Pages du manuel Linux : Fonctions des bibliothèques

ztgex2
swap adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22)
ztgexc
reorder the generalized Schur decomposition of a complex matrix pair (A,B), using an unitary equivalence transformation (A, B) := Q * (A, B) * Z', so that the diagonal block of (A, B) with row index IFST is moved to row ILST
ztgsen
reorder the generalized Schur decomposition of a complex matrix pair (A, B) (in terms of an unitary equivalence trans- formation Q' * (A, B) * Z), so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the pair (A,B)
ztgsja
compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B
ztgsna
estimate reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a matrix pair (A, B)
ztgsy2
solve the generalized Sylvester equation A * R - L * B = scale * C (1) D * R - L * E = scale * F using Level 1 and 2 BLAS, where R and L are unknown M-by-N matrices,
ztgsyl
solve the generalized Sylvester equation
ztpcon
estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
ztpmv
perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x,
ztprfs
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
ztpsv
solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b,
ztptri
compute the inverse of a complex upper or lower triangular matrix A stored in packed format
ztptrs
solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
ztrcon
estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
ztrevc
compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T
ztrexc
reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row index IFST is moved to row ILST
ztrmm
perform one of the matrix-matrix operations B := alpha*op( A )*B, or B := alpha*B*op( A ) where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of op( A ) = A or op( A ) = A' or op( A ) = conjg( A' )
ztrmv
perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x,
ztrrfs
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
ztrsen
reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in the leading positions on the diagonal of the upper triangular matrix T, and the leading columns of Q form an orthonormal basis of the corresponding right invariant subspace
ztrsm
solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B,
ztrsna
estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper triangular matrix T (or of any matrix Q*T*Q**H with Q unitary)
ztrsv
solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b,
ztrsyl
solve the complex Sylvester matrix equation
ztrti2
compute the inverse of a complex upper or lower triangular matrix
ztrtri
compute the inverse of a complex upper or lower triangular matrix A
ztrtrs
solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
ztzrqf
routine is deprecated and has been replaced by routine ZTZRZF
ztzrzf
reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations
zung2l
generate an m by n complex matrix Q with orthonormal columns,
zung2r
generate an m by n complex matrix Q with orthonormal columns,
zungbr
generate one of the complex unitary matrices Q or P**H determined by ZGEBRD when reducing a complex matrix A to bidiagonal form
zunghr
generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by ZGEHRD
zungl2
generate an m-by-n complex matrix Q with orthonormal rows,
zunglq
generate an M-by-N complex matrix Q with orthonormal rows,
zungql
generate an M-by-N complex matrix Q with orthonormal columns,
zungqr
generate an M-by-N complex matrix Q with orthonormal columns,
zungr2
generate an m by n complex matrix Q with orthonormal rows,
zungrq
generate an M-by-N complex matrix Q with orthonormal rows,
zungtr
generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by ZHETRD
zunm2l
overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C',
zunm2r
overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C',
zunmbr
VECT = 'Q', ZUNMBR overwrites the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmhr
overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunml2
overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C',
zunmlq
overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmql
overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmqr
overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmr2
overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C',
zunmr3
overwrite the general complex m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C',