hetri2#
Functions
-
void chetri2(const char *uplo, const INT n, c64 *restrict A, const INT lda, const INT *restrict ipiv, c64 *restrict work, const INT lwork, INT *info)#
CHETRI2 computes the inverse of a COMPLEX*16 hermitian indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CHETRF.
CHETRI2 sets the LEADING DIMENSION of the workspace before calling CHETRI2X that actually computes the inverse.
Parameters
inuplo'U': Upper triangular, form is A = U*D*U**T'L': Lower triangular, form is A = L*D*L**T
innThe order of the matrix A.
n>=0.inoutAArray of dimension
(lda,n). On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed bychetrf. On exit, ifinfo=0, the (symmetric) inverse of the original matrix. Ifuplo='U', the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced; ifuplo='L'the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.inldaThe leading dimension of the array A.
lda>=max(1,n).inipivArray of dimension
n. Details of the interchanges and the block structure of D as determined bychetrf.outworkArray of dimension
max(1,lwork).inlworkThe dimension of the array
work. Ifn=0,lwork>=1, elselwork>=(n+nb+1)*(nb+3). Iflwork=-1, then a workspace query is assumed; the routine calculates the optimal size of theworkarray, returns this value as the first entry of theworkarray, and no error message related tolworkis issued.outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal valueinfo>0: ifinfo=i,D(i,i)=0; the matrix is singular and its inverse could not be computed.
void chetri2(
const char* uplo,
const INT n,
c64* restrict A,
const INT lda,
const INT* restrict ipiv,
c64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void zhetri2(const char *uplo, const INT n, c128 *restrict A, const INT lda, const INT *restrict ipiv, c128 *restrict work, const INT lwork, INT *info)#
ZHETRI2 computes the inverse of a COMPLEX*16 hermitian indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZHETRF.
ZHETRI2 sets the LEADING DIMENSION of the workspace before calling ZHETRI2X that actually computes the inverse.
Parameters
inuplo'U': Upper triangular, form is A = U*D*U**T'L': Lower triangular, form is A = L*D*L**T
innThe order of the matrix A.
n>=0.inoutAArray of dimension
(lda,n). On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed byzhetrf. On exit, ifinfo=0, the (symmetric) inverse of the original matrix. Ifuplo='U', the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced; ifuplo='L'the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.inldaThe leading dimension of the array A.
lda>=max(1,n).inipivArray of dimension
n. Details of the interchanges and the block structure of D as determined byzhetrf.outworkArray of dimension
max(1,lwork).inlworkThe dimension of the array
work. Ifn=0,lwork>=1, elselwork>=(n+nb+1)*(nb+3). Iflwork=-1, then a workspace query is assumed; the routine calculates the optimal size of theworkarray, returns this value as the first entry of theworkarray, and no error message related tolworkis issued.outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal valueinfo>0: ifinfo=i,D(i,i)=0; the matrix is singular and its inverse could not be computed.
void zhetri2(
const char* uplo,
const INT n,
c128* restrict A,
const INT lda,
const INT* restrict ipiv,
c128* restrict work,
const INT lwork,
INT* info
);