ZPPSV - Online Linux Manual Page

Section : 1
Updated : November 2008
Source : LAPACK driver routine (version 3.2)
Note : LAPACK driver routine (version 3.2)

NAMEZPPSV - computes the solution to a complex system of linear equations A * X = B,

SYNOPSISSUBROUTINE ZPPSV(  UPLO, N, NRHS, AP, B, LDB, INFO )  CHARACTER UPLO  INTEGER INFO, LDB, N, NRHS  COMPLEX*16 AP( * ), B( LDB, * )

PURPOSEZPPSV computes the solution to a complex system of linear equations
   A * X = B, where A is an N-by-N Hermitian positive definite matrix stored in packed format and X and B are N-by-NRHS 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.

ARGUMENTSUPLO (input) CHARACTER*1  = 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
N (input) INTEGER  The number of linear equations, i.e., 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/output) COMPLEX*16 array, dimension (N*(N+1)/2)  On entry, the upper or lower triangle of the Hermitian matrix A, packed columnwise in a linear array. The j-th column of A is stored in the array AP as follows: if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n. See below for further details. On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H, in the same storage format as A. B (input/output) COMPLEX*16 array, dimension (LDB,NRHS)  On entry, the N-by-NRHS right hand side matrix B. On exit, if INFO = 0, the N-by-NRHS 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 i-th argument had an illegal value
> 0: if INFO = i, the leading minor of order i of A is not positive definite, so the factorization could not be completed, and the solution has not been computed.

FURTHER DETAILSThe packed storage scheme is illustrated by the following example when N = 4, UPLO = 'U':
Two-dimensional storage of the Hermitian matrix A:

   a11 a12 a13 a14

       a22 a23 a24

           a33 a34 (aij = conjg(aji))

               a44
Packed storage of the upper triangle of A:
AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
0
Johanes Gumabo
Data Size   :   8,398 byte
man-zppsv.lBuild   :   2025-03-22, 13:26   :  
Visitor Screen   :   x
Visitor Counter ( page / site )   :   1 / 1,210,059
Visitor ID   :     :  
Visitor IP   :   18.222.30.84   :  
Visitor Provider   :   AMAZON-02   :  
Provider Position ( lat x lon )   :   39.962500 x -83.006100   :   x
Provider Accuracy Radius ( km )   :   1000   :  
Provider City   :   Columbus   :  
Provider Province   :   Ohio ,   :   ,
Provider Country   :   United States   :  
Provider Continent   :   North America   :  
Visitor Recorder   :   Version   :  
Visitor Recorder   :   Library   :  
Online Linux Manual Page   :   Version   :   Online Linux Manual Page - Fedora.40 - march=x86-64 - mtune=generic - 25.03.22
Online Linux Manual Page   :   Library   :   lib_c - 24.10.03 - march=x86-64 - mtune=generic - Fedora.40
Online Linux Manual Page   :   Library   :   lib_m - 24.10.03 - march=x86-64 - mtune=generic - Fedora.40
Data Base   :   Version   :   Online Linux Manual Page Database - 24.04.13 - march=x86-64 - mtune=generic - fedora-38
Data Base   :   Library   :   lib_c - 23.02.07 - march=x86-64 - mtune=generic - fedora.36


Very long time ago, I have the best tutor, Wenzel Svojanovsky. If someone knows the email address of Wenzel Svojanovsky, please send an email to johanesgumabo@gmail.com.
Help me, linux0001.com will expire on July 16, 2025. I have no money to renew it. View detail

If error, please print screen and send to johanes_gumabo@yahoo.co.id
Under development. Support me via PayPal.