Scroll to navigation

ZPPTRS(1) LAPACK routine (version 3.2) ZPPTRS(1)

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

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

= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
The order of the matrix A. N >= 0.
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
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 j-th column of U or L is stored in the array AP as follows: if UPLO = 'U', AP(i + (j-1)*j/2) = U(i,j) for 1<=i<=j; if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = L(i,j) for j<=i<=n.
On entry, the right hand side matrix B. On exit, the solution matrix X.
The leading dimension of the array B. LDB >= max(1,N).
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
November 2008 LAPACK routine (version 3.2)