tptri#

stptri

Functions

void stptri(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          f32*  restrict AP,
          INT*           info
);

void stptri(const char *uplo, const char *diag, const INT n, f32 *restrict AP, INT *info)#

STPTRI computes the inverse of a real upper or lower triangular matrix A stored in packed format.

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

AP

On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. Array of dimension (n*(n+1)/2).

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 cannot be computed.

dtptri

Functions

void dtptri(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          f64*  restrict AP,
          INT*           info
);

void dtptri(const char *uplo, const char *diag, const INT n, f64 *restrict AP, INT *info)#

DTPTRI computes the inverse of a real upper or lower triangular matrix A stored in packed format.

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

AP

On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. Array of dimension (n*(n+1)/2).

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 cannot be computed.

ctptri

Functions

void ctptri(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          c64*  restrict AP,
          INT*           info
);

void ctptri(const char *uplo, const char *diag, const INT n, c64 *restrict AP, INT *info)#

CTPTRI computes the inverse of a complex upper or lower triangular matrix A stored in packed format.

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

AP

On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. Array of dimension (n*(n+1)/2).

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 cannot be computed.

ztptri

Functions

void ztptri(
    const char*          uplo,
    const char*          diag,
    const INT            n,
          c128* restrict AP,
          INT*           info
);

void ztptri(const char *uplo, const char *diag, const INT n, c128 *restrict AP, INT *info)#

ZTPTRI computes the inverse of a complex upper or lower triangular matrix A stored in packed format.

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

AP

On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. Array of dimension (n*(n+1)/2).

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 cannot be computed.

tptri#

This Page