cpptrs - solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
SUBROUTINE CPPTRS( UPLO, N, NRHS, A, B, LDB, INFO) CHARACTER * 1 UPLO COMPLEX A(*), B(LDB,*) INTEGER N, NRHS, LDB, INFO
SUBROUTINE CPPTRS_64( UPLO, N, NRHS, A, B, LDB, INFO) CHARACTER * 1 UPLO COMPLEX A(*), B(LDB,*) INTEGER*8 N, NRHS, LDB, INFO
SUBROUTINE PPTRS( UPLO, N, [NRHS], A, B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO COMPLEX, DIMENSION(:) :: A COMPLEX, DIMENSION(:,:) :: B INTEGER :: N, NRHS, LDB, INFO
SUBROUTINE PPTRS_64( UPLO, N, [NRHS], A, B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO COMPLEX, DIMENSION(:) :: A COMPLEX, DIMENSION(:,:) :: B INTEGER(8) :: N, NRHS, LDB, INFO
#include <sunperf.h>
void cpptrs(char uplo, int n, int nrhs, complex *a, complex *b, int ldb, int *info);
void cpptrs_64(char uplo, long n, long nrhs, complex *a, complex *b, long ldb, long *info);
cpptrs solves a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF.
= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
U(i,j)
for 1 < =i < =j;
if UPLO = 'L', A(i + (j-1)*(2n-j)/2) = L(i,j)
for j < =i < =n.
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value