trtri#

strtri

Functions

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

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

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

This is the Level 3 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
> 0: if info = i, A(i-1,i-1) is exactly zero. The triangular matrix is singular and its inverse cannot be computed.

dtrtri

Functions

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

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

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

This is the Level 3 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
> 0: if info = i, A(i-1,i-1) is exactly zero. The triangular matrix is singular and its inverse cannot be computed.

ctrtri

Functions

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

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

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

This is the Level 3 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
> 0: if info = i, A(i-1,i-1) is exactly zero. The triangular matrix is singular and its inverse cannot be computed.

ztrtri

Functions

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

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

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

This is the Level 3 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
> 0: if info = i, A(i-1,i-1) is exactly zero. The triangular matrix is singular and its inverse cannot be computed.

trtri#

This Page