hptri#

Functions

void chptri(
    const char*          uplo,
    const INT            n,
          c64*  restrict AP,
    const INT*  restrict ipiv,
          c64*  restrict work,
          INT*           info
);
void chptri(const char *uplo, const INT n, c64 *restrict AP, const INT *restrict ipiv, c64 *restrict work, INT *info)#

CHPTRI computes the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF.

Parameters

in
uplo

Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = ‘U’: Upper triangular, form is A = U*D*U**H

  • = ‘L’: Lower triangular, form is A = L*D*L**H

in
n

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

inout
AP

On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CHPTRF, stored as a packed triangular matrix of dimension n*(n+1)/2. On exit, if info = 0, the (Hermitian) inverse of the original matrix, stored as a packed triangular matrix.

in
ipiv

Details of the interchanges and the block structure of D as determined by CHPTRF. Array of dimension n.

out
work

Workspace array of dimension n.

out
info

Exit status:

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

  • > 0: if info = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.

Functions

void zhptri(
    const char*          uplo,
    const INT            n,
          c128* restrict AP,
    const INT*  restrict ipiv,
          c128* restrict work,
          INT*           info
);
void zhptri(const char *uplo, const INT n, c128 *restrict AP, const INT *restrict ipiv, c128 *restrict work, INT *info)#

ZHPTRI computes the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF.

Parameters

in
uplo

Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = ‘U’: Upper triangular, form is A = U*D*U**H

  • = ‘L’: Lower triangular, form is A = L*D*L**H

in
n

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

inout
AP

On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by ZHPTRF, stored as a packed triangular matrix of dimension n*(n+1)/2. On exit, if info = 0, the (Hermitian) inverse of the original matrix, stored as a packed triangular matrix.

in
ipiv

Details of the interchanges and the block structure of D as determined by ZHPTRF. Array of dimension n.

out
work

Workspace array of dimension n.

out
info

Exit status:

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

  • > 0: if info = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.