trti2#

strti2

Functions

void strti2(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          f32*  restrict A,
    const INT            lda,
          INT*           info
);

void strti2(const char *uplo, const char *diag, const INT n, f32 *restrict A, const INT lda, INT *info)#

STRTI2 computes the inverse of a real upper or lower triangular matrix.

This is the Level 2 BLAS version of the algorithm.

Parameters

in

uplo

‘U’: A is upper triangular; ‘L’: A is lower triangular.

in

diag

‘N’: A is non-unit triangular; ‘U’: A is unit triangular.

in

n

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

inout

A

On entry, the triangular matrix A. On exit, the (triangular) inverse of the original matrix. Array of dimension (lda, n).

in

lda

The leading dimension of the array A (lda >= max(1,n)).

out

info

Exit status:

= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value

dtrti2

Functions

void dtrti2(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          f64*  restrict A,
    const INT            lda,
          INT*           info
);

void dtrti2(const char *uplo, const char *diag, const INT n, f64 *restrict A, const INT lda, INT *info)#

DTRTI2 computes the inverse of a real upper or lower triangular matrix.

This is the Level 2 BLAS version of the algorithm.

Parameters

in

uplo

‘U’: A is upper triangular; ‘L’: A is lower triangular.

in

diag

‘N’: A is non-unit triangular; ‘U’: A is unit triangular.

in

n

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

inout

A

On entry, the triangular matrix A. On exit, the (triangular) inverse of the original matrix. Array of dimension (lda, n).

in

lda

The leading dimension of the array A (lda >= max(1,n)).

out

info

Exit status:

= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value

ctrti2

Functions

void ctrti2(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          c64*  restrict A,
    const INT            lda,
          INT*           info
);

void ctrti2(const char *uplo, const char *diag, const INT n, c64 *restrict A, const INT lda, INT *info)#

CTRTI2 computes the inverse of a complex upper or lower triangular matrix.

This is the Level 2 BLAS version of the algorithm.

Parameters

in

uplo

‘U’: A is upper triangular; ‘L’: A is lower triangular.

in

diag

‘N’: A is non-unit triangular; ‘U’: A is unit triangular.

in

n

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

inout

A

On entry, the triangular matrix A. On exit, the (triangular) inverse of the original matrix. Array of dimension (lda, n).

in

lda

The leading dimension of the array A (lda >= max(1,n)).

out

info

Exit status:

= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value

ztrti2

Functions

void ztrti2(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          c128* restrict A,
    const INT            lda,
          INT*           info
);

void ztrti2(const char *uplo, const char *diag, const INT n, c128 *restrict A, const INT lda, INT *info)#

ZTRTI2 computes the inverse of a complex upper or lower triangular matrix.

This is the Level 2 BLAS version of the algorithm.

Parameters

in

uplo

‘U’: A is upper triangular; ‘L’: A is lower triangular.

in

diag

‘N’: A is non-unit triangular; ‘U’: A is unit triangular.

in

n

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

inout

A

On entry, the triangular matrix A. On exit, the (triangular) inverse of the original matrix. Array of dimension (lda, n).

in

lda

The leading dimension of the array A (lda >= max(1,n)).

out

info

Exit status:

= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value

trti2#

This Page