zpptri (l) - Linux Manuals
zpptri: computes the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF
Command to display zpptri
manual in Linux: $ man l zpptri
NAME
ZPPTRI - computes the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF
SYNOPSIS
- SUBROUTINE ZPPTRI(
-
UPLO, N, AP, INFO )
-
CHARACTER
UPLO
-
INTEGER
INFO, N
-
COMPLEX*16
AP( * )
PURPOSE
ZPPTRI computes the inverse of a complex Hermitian positive definite
matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
computed by ZPPTRF.
ARGUMENTS
- UPLO (input) CHARACTER*1
-
= aqUaq: Upper triangular factor is stored in AP;
= aqLaq: Lower triangular factor is stored in AP.
- N (input) INTEGER
-
The order of the matrix A. N >= 0.
- AP (input/output) COMPLEX*16 array, dimension (N*(N+1)/2)
-
On entry, the triangular factor U or L from the Cholesky
factorization A = U**H*U or A = L*L**H, packed columnwise as
a linear array. The j-th column of U or L is stored in the
array AP as follows:
if UPLO = aqUaq, AP(i + (j-1)*j/2) = U(i,j) for 1<=i<=j;
if UPLO = aqLaq, AP(i + (j-1)*(2n-j)/2) = L(i,j) for j<=i<=n.
On exit, the upper or lower triangle of the (Hermitian)
inverse of A, overwriting the input factor U or L.
- INFO (output) INTEGER
-
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, the (i,i) element of the factor U or L is
zero, and the inverse could not be computed.
Pages related to zpptri
- zpptri (3)
- zpptrf (l) - computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
- zpptrs (l) - solves a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF
- zppcon (l) - estimates the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite packed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF
- zppequ (l) - computes row and column scalings intended to equilibrate a Hermitian positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)
- zpprfs (l) - improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward error estimates for the solution
- zppsv (l) - computes the solution to a complex system of linear equations A * X = B,
- zppsvx (l) - uses the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B,