cpptri (l)  Linux Man Pages
cpptri: 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 CPPTRF
Command to display cpptri
manual in Linux: $ man l cpptri
NAME
CPPTRI  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 CPPTRF
SYNOPSIS
 SUBROUTINE CPPTRI(

UPLO, N, AP, INFO )

CHARACTER
UPLO

INTEGER
INFO, N

COMPLEX
AP( * )
PURPOSE
CPPTRI 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 CPPTRF.
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 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 jth column of U or L is stored in the
array AP as follows:
if UPLO = aqUaq, AP(i + (j1)*j/2) = U(i,j) for 1<=i<=j;
if UPLO = aqLaq, AP(i + (j1)*(2nj)/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 ith 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 cpptri
 cpptri (3)
 cpptrf (l)  computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
 cpptrs (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 CPPTRF
 cppcon (l)  estimates the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite packed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
 cppequ (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 twonorm)
 cpprfs (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
 cppsv (l)  computes the solution to a complex system of linear equations A * X = B,
 cppsvx (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,