sposv - compute the solution to a real system of linear equations A * X = B,
SUBROUTINE SPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO) CHARACTER * 1 UPLO INTEGER N, NRHS, LDA, LDB, INFO REAL A(LDA,*), B(LDB,*)
SUBROUTINE SPOSV_64( UPLO, N, NRHS, A, LDA, B, LDB, INFO) CHARACTER * 1 UPLO INTEGER*8 N, NRHS, LDA, LDB, INFO REAL A(LDA,*), B(LDB,*)
SUBROUTINE POSV( UPLO, [N], [NRHS], A, [LDA], B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO INTEGER :: N, NRHS, LDA, LDB, INFO REAL, DIMENSION(:,:) :: A, B
SUBROUTINE POSV_64( UPLO, [N], [NRHS], A, [LDA], B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO INTEGER(8) :: N, NRHS, LDA, LDB, INFO REAL, DIMENSION(:,:) :: A, B
#include <sunperf.h>
void sposv(char uplo, int n, int nrhs, float *a, int lda, float *b, int ldb, int *info);
void sposv_64(char uplo, long n, long nrhs, float *a, long lda, float *b, long ldb, long *info);
sposv computes the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric positive definite matrix and X and B are N-by-NRHS matrices.
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.
= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T.
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, the leading minor of order i of A is not positive definite, so the factorization could not be completed, and the solution has not been computed.