# Pages du manuel Linux : Fonctions des bibliothèques

pzlaqge
equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and scaling factors in the vectors R and C
pzlaqsy
equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling factors in the vectors SR and SC
pzlarf
applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pzlarfb
applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right
pzlarfc
applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),
pzlarfg
generate a complex elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I
pzlarft
form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
pzlarz
applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pzlarzb
applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right
pzlarzc
applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),
pzlarzt
form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PZTZRZF
pzlascl
multiplie the M-by-N complex distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real scalar CTO/CFROM
pzlase2
initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
pzlaset
initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
pzlassq
return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
pzlaswp
perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
pzlatra
compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )
pzlatrd
reduce NB rows and columns of a complex Hermitian distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) to complex tridiagonal form by an unitary similarity transformation Q' * sub( A ) * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of sub( A )
pzlatrs
solve a triangular system
pzlatrz
reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix sub( A ) = [A(IA:IA+M-1,JA:JA+M-1) A(IA:IA+M-1,JA+N-L:JA+N-1)]
pzlauu2
compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pzlauum
compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pzmax1
compute the global index of the maximum element in absolute value of a distributed vector sub( X )
pzpbsv
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpbtrf
compute a Cholesky factorization of an N-by-N complex banded symmetric positive definite distributed matrix with bandwidth BW
pzpbtrs
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpbtrsv
solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpocon
estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite distributed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by PZPOTRF
pzpoequ
compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm)
pzporfs
improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
pzposv
compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),
pzposvx
use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
pzpotf2
compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)
pzpotrf
compute the Cholesky factorization of an N-by-N complex hermitian positive definite distributed matrix sub( A ) denoting A(IA:IA+N-1, JA:JA+N-1)
pzpotri
compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**H*U or L*L**H computed by PZPOTRF
pzpotrs
solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)
pzptsv
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpttrf
compute a Cholesky factorization of an N-by-N complex tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)
pzpttrs
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpttrsv
solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzstein
compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
pztrcon
estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
pztrrfs
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
pztrti2
compute the inverse of a complex upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pztrtri
compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pztrtrs
solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ) or sub( A )**H * X = sub( B ),
pztzrzf
reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper triangular form by means of unitary transformations
pzung2l
generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M Q = H(k)
pzung2r
generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M Q = H(1) H(2)
pzungl2
generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N Q = H(k)'