sptrs#
Functions
-
void ssptrs(const char *uplo, const INT n, const INT nrhs, const f32 *restrict AP, const INT *restrict ipiv, f32 *restrict B, const INT ldb, INT *info)#
SSPTRS solves a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF.
Parameters
inuplo'U': Upper triangular, form is A = U*D*U**T'L': Lower triangular, form is A = L*D*L**T
innThe order of the matrix A.
n>=0.innrhsThe number of right hand sides, i.e., the number of columns of the matrix B.
nrhs>=0.inAPArray of dimension
n*(n+1)/2. The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed byssptrf, stored as a packed triangular matrix.inipivArray of dimension
n. Details of the interchanges and the block structure of D as determined byssptrf.inoutBArray of dimension
(ldb,nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.inldbThe leading dimension of the array B.
ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void ssptrs(
const char* uplo,
const INT n,
const INT nrhs,
const f32* restrict AP,
const INT* restrict ipiv,
f32* restrict B,
const INT ldb,
INT* info
);
Functions
-
void dsptrs(const char *uplo, const INT n, const INT nrhs, const f64 *restrict AP, const INT *restrict ipiv, f64 *restrict B, const INT ldb, INT *info)#
DSPTRS solves a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF.
Parameters
inuplo'U': Upper triangular, form is A = U*D*U**T'L': Lower triangular, form is A = L*D*L**T
innThe order of the matrix A.
n>=0.innrhsThe number of right hand sides, i.e., the number of columns of the matrix B.
nrhs>=0.inAPArray of dimension
n*(n+1)/2. The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed bydsptrf, stored as a packed triangular matrix.inipivArray of dimension
n. Details of the interchanges and the block structure of D as determined bydsptrf.inoutBArray of dimension
(ldb,nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.inldbThe leading dimension of the array B.
ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void dsptrs(
const char* uplo,
const INT n,
const INT nrhs,
const f64* restrict AP,
const INT* restrict ipiv,
f64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void csptrs(const char *uplo, const INT n, const INT nrhs, const c64 *restrict AP, const INT *restrict ipiv, c64 *restrict B, const INT ldb, INT *info)#
CSPTRS solves a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF.
Parameters
inuplo'U': Upper triangular, form is A = U*D*U**T'L': Lower triangular, form is A = L*D*L**T
innThe order of the matrix A.
n>=0.innrhsThe number of right hand sides, i.e., the number of columns of the matrix B.
nrhs>=0.inAPComplex array of dimension
n*(n+1)/2. The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed bycsptrf, stored as a packed triangular matrix.inipivArray of dimension
n. Details of the interchanges and the block structure of D as determined bycsptrf.inoutBComplex array of dimension
(ldb,nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.inldbThe leading dimension of the array B.
ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void csptrs(
const char* uplo,
const INT n,
const INT nrhs,
const c64* restrict AP,
const INT* restrict ipiv,
c64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void zsptrs(const char *uplo, const INT n, const INT nrhs, const c128 *restrict AP, const INT *restrict ipiv, c128 *restrict B, const INT ldb, INT *info)#
ZSPTRS solves a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF.
Parameters
inuplo'U': Upper triangular, form is A = U*D*U**T'L': Lower triangular, form is A = L*D*L**T
innThe order of the matrix A.
n>=0.innrhsThe number of right hand sides, i.e., the number of columns of the matrix B.
nrhs>=0.inAPComplex array of dimension
n*(n+1)/2. The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed byzsptrf, stored as a packed triangular matrix.inipivArray of dimension
n. Details of the interchanges and the block structure of D as determined byzsptrf.inoutBComplex array of dimension
(ldb,nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.inldbThe leading dimension of the array B.
ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void zsptrs(
const char* uplo,
const INT n,
const INT nrhs,
const c128* restrict AP,
const INT* restrict ipiv,
c128* restrict B,
const INT ldb,
INT* info
);