tptrs#

stptrs

Functions

void stptrs(
    const char*          uplo,
    const char*          trans,
    const char*          diag,
    const INT            n,
    const INT            nrhs,
    const f32*  restrict AP,
          f32*  restrict B,
    const INT            ldb,
          INT*           info
);

void stptrs(const char *uplo, const char *trans, const char *diag, const INT n, const INT nrhs, const f32 *restrict AP, f32 *restrict B, const INT ldb, INT *info)#

STPTRS solves a triangular system of the form.

A * X = B or A**T * X = B,

where A is a triangular matrix of order N stored in packed format, and B is an N-by-NRHS matrix.

Parameters

in

uplo

= ‘U’: A is upper triangular = ‘L’: A is lower triangular

in

trans

= ‘N’: A * X = B (No transpose) = ‘T’: A**T * X = B (Transpose) = ‘C’: A**H * X = B (Conjugate transpose = Transpose)

in

diag

= ‘N’: A is non-unit triangular = ‘U’: A is unit triangular

in

n

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

in

nrhs

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

in

AP

The packed triangular matrix A. Array of dimension (n*(n+1)/2).

inout

B

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

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
> 0: if info = i, the i-th diagonal element is exactly zero

dtptrs

Functions

void dtptrs(
    const char*          uplo,
    const char*          trans,
    const char*          diag,
    const INT            n,
    const INT            nrhs,
    const f64*  restrict AP,
          f64*  restrict B,
    const INT            ldb,
          INT*           info
);

void dtptrs(const char *uplo, const char *trans, const char *diag, const INT n, const INT nrhs, const f64 *restrict AP, f64 *restrict B, const INT ldb, INT *info)#

DTPTRS solves a triangular system of the form.

A * X = B or A**T * X = B,

where A is a triangular matrix of order N stored in packed format, and B is an N-by-NRHS matrix.

Parameters

in

uplo

= ‘U’: A is upper triangular = ‘L’: A is lower triangular

in

trans

= ‘N’: A * X = B (No transpose) = ‘T’: A**T * X = B (Transpose) = ‘C’: A**H * X = B (Conjugate transpose = Transpose)

in

diag

= ‘N’: A is non-unit triangular = ‘U’: A is unit triangular

in

n

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

in

nrhs

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

in

AP

The packed triangular matrix A. Array of dimension (n*(n+1)/2).

inout

B

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

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
> 0: if info = i, the i-th diagonal element is exactly zero

ctptrs

Functions

void ctptrs(
    const char*          uplo,
    const char*          trans,
    const char*          diag,
    const INT            n,
    const INT            nrhs,
    const c64*  restrict AP,
          c64*  restrict B,
    const INT            ldb,
          INT*           info
);

void ctptrs(const char *uplo, const char *trans, const char *diag, const INT n, const INT nrhs, const c64 *restrict AP, c64 *restrict B, const INT ldb, INT *info)#

CTPTRS solves a triangular system of the form.

A * X = B, A**T * X = B, or A**H * X = B,

where A is a triangular matrix of order N stored in packed format, and B is an N-by-NRHS matrix.

Parameters

in

uplo

= ‘U’: A is upper triangular = ‘L’: A is lower triangular

in

trans

= ‘N’: A * X = B (No transpose) = ‘T’: A**T * X = B (Transpose) = ‘C’: A**H * X = B (Conjugate transpose)

in

diag

= ‘N’: A is non-unit triangular = ‘U’: A is unit triangular

in

n

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

in

nrhs

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

in

AP

The packed triangular matrix A. Array of dimension (n*(n+1)/2).

inout

B

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

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
> 0: if info = i, the i-th diagonal element is exactly zero

ztptrs

Functions

void ztptrs(
    const char*          uplo,
    const char*          trans,
    const char*          diag,
    const INT            n,
    const INT            nrhs,
    const c128* restrict AP,
          c128* restrict B,
    const INT            ldb,
          INT*           info
);

void ztptrs(const char *uplo, const char *trans, const char *diag, const INT n, const INT nrhs, const c128 *restrict AP, c128 *restrict B, const INT ldb, INT *info)#

ZTPTRS solves a triangular system of the form.

A * X = B, A**T * X = B, or A**H * X = B,

where A is a triangular matrix of order N stored in packed format, and B is an N-by-NRHS matrix.

Parameters

in

uplo

= ‘U’: A is upper triangular = ‘L’: A is lower triangular

in

trans

= ‘N’: A * X = B (No transpose) = ‘T’: A**T * X = B (Transpose) = ‘C’: A**H * X = B (Conjugate transpose)

in

diag

= ‘N’: A is non-unit triangular = ‘U’: A is unit triangular

in

n

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

in

nrhs

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

in

AP

The packed triangular matrix A. Array of dimension (n*(n+1)/2).

inout

B

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

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
> 0: if info = i, the i-th diagonal element is exactly zero

tptrs#

This Page