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
);
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

in
uplo

Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = ‘U’: Upper triangular, form is A = U*D*U**T

  • = ‘L’: Lower triangular, form is A = L*D*L**T

in
n

The order of the matrix A. n >= 0.

in
nrhs

The number of right hand sides, i.e., the number of columns of the matrix B. nrhs >= 0.

in
AP

The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSPTRF, stored as a packed triangular matrix of dimension n*(n+1)/2.

in
ipiv

Details of the interchanges and the block structure of D as determined by SSPTRF. Array of dimension n.

inout
B

On entry, the right hand side matrix B of dimension (ldb, nrhs). On exit, the solution matrix X.

in
ldb

The leading dimension of the array B. ldb >= max(1,n).

out
info

Exit status:

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

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
);
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

in
uplo

Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = ‘U’: Upper triangular, form is A = U*D*U**T

  • = ‘L’: Lower triangular, form is A = L*D*L**T

in
n

The order of the matrix A. n >= 0.

in
nrhs

The number of right hand sides, i.e., the number of columns of the matrix B. nrhs >= 0.

in
AP

The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by DSPTRF, stored as a packed triangular matrix of dimension n*(n+1)/2.

in
ipiv

Details of the interchanges and the block structure of D as determined by DSPTRF. Array of dimension n.

inout
B

On entry, the right hand side matrix B of dimension (ldb, nrhs). On exit, the solution matrix X.

in
ldb

The leading dimension of the array B. ldb >= max(1,n).

out
info

Exit status:

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

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
);
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

in
uplo

Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = ‘U’: Upper triangular, form is A = U*D*U**T

  • = ‘L’: Lower triangular, form is A = L*D*L**T

in
n

The order of the matrix A. n >= 0.

in
nrhs

The number of right hand sides, i.e., the number of columns of the matrix B. nrhs >= 0.

in
AP

The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CSPTRF, stored as a packed triangular matrix of dimension n*(n+1)/2.

in
ipiv

Details of the interchanges and the block structure of D as determined by CSPTRF. Array of dimension n.

inout
B

On entry, the right hand side matrix B of dimension (ldb, nrhs). On exit, the solution matrix X.

in
ldb

The leading dimension of the array B. ldb >= max(1,n).

out
info

Exit status:

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

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
);
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

in
uplo

Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = ‘U’: Upper triangular, form is A = U*D*U**T

  • = ‘L’: Lower triangular, form is A = L*D*L**T

in
n

The order of the matrix A. n >= 0.

in
nrhs

The number of right hand sides, i.e., the number of columns of the matrix B. nrhs >= 0.

in
AP

The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by ZSPTRF, stored as a packed triangular matrix of dimension n*(n+1)/2.

in
ipiv

Details of the interchanges and the block structure of D as determined by ZSPTRF. Array of dimension n.

inout
B

On entry, the right hand side matrix B of dimension (ldb, nrhs). On exit, the solution matrix X.

in
ldb

The leading dimension of the array B. ldb >= max(1,n).

out
info

Exit status:

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value