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

UPLO, N, NRHS, AP, B, LDB, INFO )

CHARACTER
UPLO

INTEGER
INFO, LDB, N, NRHS

COMPLEX*16
AP( * ), B( LDB, * )
PURPOSE
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.
ARGUMENTS
 UPLO (input) CHARACTER*1

= aqUaq: Upper triangle of A is stored;
= aqLaq: Lower triangle of A is stored.
 N (input) INTEGER

The order of the matrix A. N >= 0.
 NRHS (input) INTEGER

The number of right hand sides, i.e., the number of columns
of the matrix B. NRHS >= 0.
 AP (input) COMPLEX*16 array, dimension (N*(N+1)/2)

The triangular factor U or L from the Cholesky factorization
A = U**H*U or A = L*L**H, packed columnwise in 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.
 B (input/output) COMPLEX*16 array, dimension (LDB,NRHS)

On entry, the right hand side matrix B.
On exit, the solution matrix X.
 LDB (input) INTEGER

The leading dimension of the array B. LDB >= max(1,N).
 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
Pages related to zpptrs
 zpptrs (3)
 zpptrf (l)  computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
 zpptri (l)  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
 zppcon (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 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 twonorm)
 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,