
complib/zposv(3)  X = B,

ZPOSV computes the solution to a complex system of linear equations A * X = B, where A is an NbyN Hermitian positive definite matrix and X and B are NbyNRHS matrices. The Cholesky decomposition is used to factor A as A = U**H* U, if UPLO = 'U', or A = L * L**H, if UPLO = 'L', where U is an upper triangular matrix and L is a lower triangular matrix. The factored form of A is then used to solve the system of equations A * X = B.... 
complib/zposvx(3)  compute the solution to a complex system of linear equations A * X = B,

ZPOSVX 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, where A is an NbyN Hermitian positive definite matrix and X and B are NbyNRHS matrices. Error bounds on the solution and a condition estimate are also provided. 

complib/zpotf2(3)  compute the Cholesky factorization of a complex Hermitian positive definite matrix A

ZPOTF2 computes the Cholesky factorization of a complex Hermitian positive definite matrix A. The factorization has the form A = U' * U , if UPLO = 'U', or A = L * L', if UPLO = 'L', where U is an upper triangular matrix and L is lower triangular. This is the unblocked version of the algorithm, calling Level 2 BLAS. 
complib/zpotrf(3)  compute the Cholesky factorization of a complex Hermitian positive definite matrix A

ZPOTRF computes the Cholesky factorization of a complex Hermitian positive definite matrix A. The factorization has the form A = U**H * U, if UPLO = 'U', or A = L * L**H, if UPLO = 'L', where U is an upper triangular matrix and L is lower triangular. This is the block version of the algorithm, calling Level 3 BLAS. 
complib/zpotri(3)  compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**

ZPOTRI 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 ZPOTRF. 
complib/zpotrs(3)  solve a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky fact

ZPOTRS solves a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPOTRF. 
complib/zppcon(3)  estimate the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite packe

ZPPCON 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 ZPPTRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). 
complib/zppequ(3)  compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A in packed stora

ZPPEQU 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). S contains the scale factors, S(i)=1/sqrt(A(i,i)), chosen so that the scaled matrix B with elements B(i,j)=S(i)*A(i,j)*S(j) has ones on the diagonal. This choice of S puts the condition number of B within a factor N of the smallest possible condition number over all possible diagonal scalings.... 
complib/zpprfs(3)  when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward

ZPPRFS 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. 
complib/zppsv(3)  X = B,

ZPPSV computes the solution to a complex system of linear equations A * X = B, where A is an NbyN Hermitian positive definite matrix stored in packed format and X and B are NbyNRHS matrices. The Cholesky decomposition is used to factor A as A = U**H* U, if UPLO = 'U', or A = L * L**H, if UPLO = 'L', where U is an upper triangular matrix and L is a lower triangular matrix. The factored form of A is then used to solve the system of equations A * X = B.... 
complib/zppsvx(3)  compute the solution to a complex system of linear equations A * X = B,

ZPPSVX 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, where A is an NbyN Hermitian positive definite matrix stored in packed format and X and B are NbyNRHS matrices. Error bounds on the solution and a condition estimate are also provided. 
complib/zpptrf(3)  compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format

ZPPTRF computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format. The factorization has the form A = U**H * U, if UPLO = 'U', or A = L * L**H, if UPLO = 'L', where U is an upper triangular matrix and L is lower triangular. 
complib/zpptri(3)  compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**

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. 
complib/zpptrs(3)  solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using

ZPPTRS 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. 
complib/zptcon(3)  compute the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite tridia

ZPTCON computes the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by ZPTTRF. Norm(inv(A)) is computed by a direct method, and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). 