tftri#

stftri

Functions

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

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

STFTRI computes the inverse of a triangular matrix A stored in RFP format.

This is a Level 3 BLAS version of the algorithm.

Parameters

in

transr

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

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

Double precision array, dimension (n*(n+1)/2). On entry, the triangular matrix in RFP format. On exit, the (triangular) inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, A(i,i) is exactly zero. The triangular matrix is singular and its inverse can not be computed.

dtftri

Functions

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

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

DTFTRI computes the inverse of a triangular matrix A stored in RFP format.

This is a Level 3 BLAS version of the algorithm.

Parameters

in

transr

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

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

Double precision array, dimension (n*(n+1)/2). On entry, the triangular matrix in RFP format. On exit, the (triangular) inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, A(i,i) is exactly zero. The triangular matrix is singular and its inverse can not be computed.

ctftri

Functions

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

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

CTFTRI computes the inverse of a triangular matrix A stored in RFP format.

This is a Level 3 BLAS version of the algorithm.

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’: 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

Complex*16 array, dimension (n*(n+1)/2). On entry, the triangular matrix in RFP format. On exit, the (triangular) inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, A(i,i) is exactly zero. The triangular matrix is singular and its inverse can not be computed.

ztftri

Functions

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

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

ZTFTRI computes the inverse of a triangular matrix A stored in RFP format.

This is a Level 3 BLAS version of the algorithm.

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’: 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

Complex*16 array, dimension (n*(n+1)/2). On entry, the triangular matrix in RFP format. On exit, the (triangular) inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, A(i,i) is exactly zero. The triangular matrix is singular and its inverse can not be computed.

tftri#

This Page