spsv#
Functions
-
void sspsv(const char *uplo, const INT n, const INT nrhs, f32 *restrict AP, INT *restrict ipiv, f32 *restrict B, const INT ldb, INT *info)#
SSPSV computes the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices.
The diagonal pivoting method is used to factor A as A = U * D * U**T, if UPLO = ‘U’, or A = L * D * L**T, if UPLO = ‘L’, where U (or L) is a product of permutation and unit upper (lower) triangular matrices, D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inoutAPOn entry, the packed symmetric matrix A. On exit, the factorization from SSPTRF. Array of dimension (n*(n+1)/2).
outipivThe pivot indices from SSPTRF. Array of dimension (n).
inoutBOn entry, the right hand side matrix B. On exit, the solution matrix X. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1,n).
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, D(i,i) is exactly zero
void sspsv(
const char* uplo,
const INT n,
const INT nrhs,
f32* restrict AP,
INT* restrict ipiv,
f32* restrict B,
const INT ldb,
INT* info
);
Functions
-
void dspsv(const char *uplo, const INT n, const INT nrhs, f64 *restrict AP, INT *restrict ipiv, f64 *restrict B, const INT ldb, INT *info)#
DSPSV computes the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices.
The diagonal pivoting method is used to factor A as A = U * D * U**T, if UPLO = ‘U’, or A = L * D * L**T, if UPLO = ‘L’, where U (or L) is a product of permutation and unit upper (lower) triangular matrices, D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inoutAPOn entry, the packed symmetric matrix A. On exit, the factorization from DSPTRF. Array of dimension (n*(n+1)/2).
outipivThe pivot indices from DSPTRF. Array of dimension (n).
inoutBOn entry, the right hand side matrix B. On exit, the solution matrix X. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1,n).
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, D(i,i) is exactly zero
void dspsv(
const char* uplo,
const INT n,
const INT nrhs,
f64* restrict AP,
INT* restrict ipiv,
f64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void cspsv(const char *uplo, const INT n, const INT nrhs, c64 *restrict AP, INT *restrict ipiv, c64 *restrict B, const INT ldb, INT *info)#
CSPSV computes the solution to a complex system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices.
The diagonal pivoting method is used to factor A as A = U * D * U**T, if UPLO = ‘U’, or A = L * D * L**T, if UPLO = ‘L’, where U (or L) is a product of permutation and unit upper (lower) triangular matrices, D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inoutAPOn entry, the packed symmetric matrix A. On exit, the factorization from CSPTRF. Array of dimension (n*(n+1)/2).
outipivThe pivot indices from CSPTRF. Array of dimension (n).
inoutBOn entry, the right hand side matrix B. On exit, the solution matrix X. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1,n).
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, D(i,i) is exactly zero
void cspsv(
const char* uplo,
const INT n,
const INT nrhs,
c64* restrict AP,
INT* restrict ipiv,
c64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void zspsv(const char *uplo, const INT n, const INT nrhs, c128 *restrict AP, INT *restrict ipiv, c128 *restrict B, const INT ldb, INT *info)#
ZSPSV computes the solution to a complex system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices.
The diagonal pivoting method is used to factor A as A = U * D * U**T, if UPLO = ‘U’, or A = L * D * L**T, if UPLO = ‘L’, where U (or L) is a product of permutation and unit upper (lower) triangular matrices, D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inoutAPOn entry, the packed symmetric matrix A. On exit, the factorization from ZSPTRF. Array of dimension (n*(n+1)/2).
outipivThe pivot indices from ZSPTRF. Array of dimension (n).
inoutBOn entry, the right hand side matrix B. On exit, the solution matrix X. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1,n).
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, D(i,i) is exactly zero
void zspsv(
const char* uplo,
const INT n,
const INT nrhs,
c128* restrict AP,
INT* restrict ipiv,
c128* restrict B,
const INT ldb,
INT* info
);