pftrs

spftrs

Functions

void spftrs(
    const char*          transr,
    const char*          uplo,
    const INT            n,
    const INT            nrhs,
    const f32*  restrict A,
          f32*  restrict B,
    const INT            ldb,
          INT*           info
);

void spftrs(const char *transr, const char *uplo, const INT n, const INT nrhs, const f32 *restrict A, f32 *restrict B, const INT ldb, INT *info)

SPFTRS solves a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPFTRF.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘T’: The Transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

in

nrhs

The number of right hand sides. nrhs >= 0.

in

A

Double precision array, dimension (n*(n+1)/2). The triangular factor U or L from the Cholesky factorization.

inout

B

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

in

ldb

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

out

info

• = 0: successful exit

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

dpftrs

Functions

void dpftrs(
    const char*          transr,
    const char*          uplo,
    const INT            n,
    const INT            nrhs,
    const f64*  restrict A,
          f64*  restrict B,
    const INT            ldb,
          INT*           info
);

void dpftrs(const char *transr, const char *uplo, const INT n, const INT nrhs, const f64 *restrict A, f64 *restrict B, const INT ldb, INT *info)

DPFTRS solves a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPFTRF.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘T’: The Transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

in

nrhs

The number of right hand sides. nrhs >= 0.

in

A

Double precision array, dimension (n*(n+1)/2). The triangular factor U or L from the Cholesky factorization.

inout

B

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

in

ldb

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

out

info

• = 0: successful exit

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

cpftrs

Functions

void cpftrs(
    const char*          transr,
    const char*          uplo,
    const INT            n,
    const INT            nrhs,
    const c64*  restrict A,
          c64*  restrict B,
    const INT            ldb,
          INT*           info
);

void cpftrs(const char *transr, const char *uplo, const INT n, const INT nrhs, const c64 *restrict A, c64 *restrict B, const INT ldb, INT *info)

CPFTRS solves a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPFTRF.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘C’: The Conjugate-transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

in

nrhs

The number of right hand sides. nrhs >= 0.

in

A

Complex*16 array, dimension (n*(n+1)/2). The triangular factor U or L from the Cholesky factorization.

inout

B

Complex*16 array, dimension (ldb, nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.

in

ldb

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

out

info

• = 0: successful exit

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

zpftrs

Functions

void zpftrs(
    const char*          transr,
    const char*          uplo,
    const INT            n,
    const INT            nrhs,
    const c128* restrict A,
          c128* restrict B,
    const INT            ldb,
          INT*           info
);

void zpftrs(const char *transr, const char *uplo, const INT n, const INT nrhs, const c128 *restrict A, c128 *restrict B, const INT ldb, INT *info)

ZPFTRS solves a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPFTRF.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘C’: The Conjugate-transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

in

nrhs

The number of right hand sides. nrhs >= 0.

in

A

Complex*16 array, dimension (n*(n+1)/2). The triangular factor U or L from the Cholesky factorization.

inout

B

Complex*16 array, dimension (ldb, nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.

in

ldb

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

out

info

• = 0: successful exit

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