SUBROUTINE SPPSV( UPLO, N, NRHS, A, B, LDB, INFO) CHARACTER * 1 UPLO INTEGER N, NRHS, LDB, INFO REAL A(*), B(LDB,*) SUBROUTINE SPPSV_64( UPLO, N, NRHS, A, B, LDB, INFO) CHARACTER * 1 UPLO INTEGER*8 N, NRHS, LDB, INFO REAL A(*), B(LDB,*)
SUBROUTINE PPSV( UPLO, N, [NRHS], A, B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO INTEGER :: N, NRHS, LDB, INFO REAL, DIMENSION(:) :: A REAL, DIMENSION(:,:) :: B SUBROUTINE PPSV_64( UPLO, N, [NRHS], A, B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO INTEGER(8) :: N, NRHS, LDB, INFO REAL, DIMENSION(:) :: A REAL, DIMENSION(:,:) :: B
void sppsv(char uplo, int n, int nrhs, float *a, float *b, int ldb, int *info);
void sppsv_64(char uplo, long n, long nrhs, float *a, float *b, long ldb, long *info);
The Cholesky decomposition is used to factor A as
A = U**T* U, if UPLO = 'U', or A = L * L**T, if UPLO = 'L',
where U is an upper triangular matrix and L is a lower triangular matrix. The factored form of A is then used to solve the system of equations A * X = B.
On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T, in the same storage format as A.