# Pages du manuel Linux : Fonctions des bibliothèques

zlalsd
use the singular value decomposition of A to solve the least squares problem of finding X to minimize the Euclidean norm of each column of A*X-B, where A is N-by-N upper bidiagonal, and X and B are N-by-NRHS
zlangb
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals
zlange
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex matrix A
zlangt
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex tridiagonal matrix A
zlanhb
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n hermitian band matrix A, with k super-diagonals
zlanhe
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A
zlanhp
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A, supplied in packed form
zlanhs
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A
zlanht
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex Hermitian tridiagonal matrix A
zlansb
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals
zlansp
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A, supplied in packed form
zlansy
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A
zlantb
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals
zlantp
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form
zlantr
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A
zlapll
two column vectors X and Y, let A = ( X Y )
zlapmt
rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N
zlaqgb
equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C
zlaqge
equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C
zlaqhb
equilibrate a symmetric band matrix A using the scaling factors in the vector S
zlaqhe
equilibrate a Hermitian matrix A using the scaling factors in the vector S
zlaqhp
equilibrate a Hermitian matrix A using the scaling factors in the vector S
zlaqp2
compute a QR factorization with column pivoting of the block A(OFFSET+1:M,1:N)
zlaqps
compute a step of QR factorization with column pivoting of a complex M-by-N matrix A by using Blas-3
zlaqsb
equilibrate a symmetric band matrix A using the scaling factors in the vector S
zlaqsp
equilibrate a symmetric matrix A using the scaling factors in the vector S
zlaqsy
equilibrate a symmetric matrix A using the scaling factors in the vector S
zlar1v
compute the (scaled) r-th column of the inverse of the sumbmatrix in rows B1 through BN of the tridiagonal matrix L D L^T - sigma I
zlar2v
applie a vector of complex plane rotations with real cosines from both sides to a sequence of 2-by-2 complex Hermitian matrices,
zlarcm
perform a very simple matrix-matrix multiplication
zlarf
applie a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right
zlarfb
applie a complex block reflector H or its transpose H' to a complex M-by-N matrix C, from either the left or the right
zlarfg
generate a complex elementary reflector H of order n, such that H' * ( alpha ) = ( beta ), H' * H = I
zlarft
form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
zlarfx
applie a complex elementary reflector H to a complex m by n matrix C, from either the left or the right
zlargv
generate a vector of complex plane rotations with real cosines, determined by elements of the complex vectors x and y
zlarnv
return a vector of n random complex numbers from a uniform or normal distribution
zlarrv
compute the eigenvectors of the tridiagonal matrix T = L D L^T given L, D and the eigenvalues of L D L^T
zlartg
generate a plane rotation so that [ CS SN ] [ F ] [ R ] [ __ ]
zlartv
applie a vector of complex plane rotations with real cosines to elements of the complex vectors x and y
zlarz
applie a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right
zlarzb
applie a complex block reflector H or its transpose H**H to a complex distributed M-by-N C from the left or the right
zlarzt
form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors
zlascl
multiplie the M by N complex matrix A by the real scalar CTO/CFROM
zlaset
initialize a 2-D array A to BETA on the diagonal and ALPHA on the offdiagonals
zlasr
perform the transformation A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) where A is an m by n complex matrix and P is an orthogonal matrix,
zlassq
return the values scl and ssq such that ( scl**2 )*ssq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
zlaswp
perform a series of row interchanges on the matrix A
zlasyf
compute a partial factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
zlatbs
solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b,