# Pages du manuel Linux : Fonctions des bibliothèques

ctanhl
See ctanh.3posix
ctanl
See ctan.3posix
ctbcon
estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
ctbmv
perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x,
ctbrfs
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
ctbsv
solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b,
ctbtrs
solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
ctermid
Obtenir le nom du terminal de contrôle.
ctermid
generate a pathname for the controlling terminal
ctgevc
compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B)
ctgex2
swap adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22)
ctgexc
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
ctgsen
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)
ctgsja
compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B
ctgsna
estimate reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a matrix pair (A, B)
ctgsy2
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,
ctgsyl
solve the generalized Sylvester equation
ctime
Conversions de dates et heures binaires en ASCII.
ctime
convert a time value to a date and time string
ctime_r
See ctime.3posix
ctpcon
estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
ctpmv
perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x,
ctprfs
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
ctpsv
solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b,
ctptri
compute the inverse of a complex upper or lower triangular matrix A stored in packed format
ctptrs
solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
ctrcon
estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
ctrevc
compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T
ctrexc
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
ctrmm
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' )
ctrmv
perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x,
ctrrfs
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
ctrsen
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
ctrsm
solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B,
ctrsna
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)
ctrsv
solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b,
ctrsyl
solve the complex Sylvester matrix equation
ctrti2
compute the inverse of a complex upper or lower triangular matrix
ctrtri
compute the inverse of a complex upper or lower triangular matrix A
ctrtrs
solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
ctzrqf
routine is deprecated and has been replaced by routine CTZRZF
ctzrzf
reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations
cung2l
generate an m by n complex matrix Q with orthonormal columns,
cung2r
generate an m by n complex matrix Q with orthonormal columns,
cungbr
generate one of the complex unitary matrices Q or P**H determined by CGEBRD when reducing a complex matrix A to bidiagonal form
cunghr
generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by CGEHRD
cungl2
generate an m-by-n complex matrix Q with orthonormal rows,
cunglq
generate an M-by-N complex matrix Q with orthonormal rows,
cungql
generate an M-by-N complex matrix Q with orthonormal columns,
cungqr
generate an M-by-N complex matrix Q with orthonormal columns,