# Pages du manuel Linux : Fonctions des bibliothèques

zggqrf
compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
zggrqf
compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
zggsvd
compute the generalized singular value decomposition (GSVD) of an M-by-N complex matrix A and P-by-N complex matrix B
zggsvp
compute unitary matrices U, V and Q such that N-K-L K L U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0
zgtcon
estimate the reciprocal of the condition number of a complex tridiagonal matrix A using the LU factorization as computed by ZGTTRF
zgtrfs
improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
zgtsv
solve the equation A*X = B,
zgtsvx
use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
zgttrf
compute an LU factorization of a complex tridiagonal matrix A using elimination with partial pivoting and row interchanges
zgttrs
solve one of the systems of equations A * X = B, A**T * X = B, or A**H * X = B,
zgtts2
solve one of the systems of equations A * X = B, A**T * X = B, or A**H * X = B,
zhbev
compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevd
compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevx
compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbgst
reduce a complex Hermitian-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y,
zhbgv
compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
zhbgvd
compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
zhbgvx
compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
zhbmv
perform the matrix-vector operation y := alpha*A*x + beta*y,
zhbtrd
reduce a complex Hermitian band matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhecon
estimate the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zheev
compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevd
compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevr
compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix T
zheevx
compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zhegs2
reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegst
reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegv
compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
zhegvd
compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
zhegvx
compute selected eigenvalues, and optionally, eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
zhemm
perform one of the matrix-matrix operations C := alpha*A*B + beta*C,
zhemv
perform the matrix-vector operation y := alpha*A*x + beta*y,
zher
perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A,
zher2
perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A,
zher2k
perform one of the hermitian rank 2k operations C := alpha*A*conjg( B' ) + conjg( alpha )*B*conjg( A' ) + beta*C,
zherfs
improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates for the solution
zherk
perform one of the hermitian rank k operations C := alpha*A*conjg( A' ) + beta*C,
zhesv
compute the solution to a complex system of linear equations A * X = B,
zhesvx
use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
zhetd2
reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetf2
compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetrd
reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetrf
compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetri
compute the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zhetrs
solve a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zhgeqz
implement a single-shift version of the QZ method for finding the generalized eigenvalues w(i)=ALPHA(i)/BETA(i) of the equation det( A - w(i) B ) = 0 If JOB='S', then the pair (A,B) is simultaneously reduced to Schur form (i.e., A and B are both upper triangular) by applying one unitary tranformation (usually called Q) on the left and another (usually called Z) on the right
zhpcon
estimate the reciprocal of the condition number of a complex Hermitian packed matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF
zhpev
compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage
zhpevd
compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
zhpevx
compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage