# Pages du manuel Linux : Fonctions des bibliothèques

dstein2
compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
dsteqr
compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
dsteqr2
i a modified version of LAPACK routine DSTEQR
dsterf
compute all eigenvalues of a symmetric tridiagonal matrix using the Pal-Walker-Kahan variant of the QL or QR algorithm
dstev
compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A
dstevd
compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix
dstevr
compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix T
dstevx
compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A
DString
manipulate dynamic strings
dsycon
estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF
dsyev
compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
dsyevd
compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
dsyevr
compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix T
dsyevx
compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
dsygs2
reduce a real symmetric-definite generalized eigenproblem to standard form
dsygst
reduce a real symmetric-definite generalized eigenproblem to standard form
dsygv
compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
dsygvd
compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
dsygvx
compute selected eigenvalues, and optionally, eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
dsymm
perform one of the matrix-matrix operations C := alpha*A*B + beta*C,
dsymv
perform the matrix-vector operation y := alpha*A*x + beta*y,
dsyr
perform the symmetric rank 1 operation A := alpha*x*x' + A,
dsyr2
perform the symmetric rank 2 operation A := alpha*x*y' + alpha*y*x' + A,
dsyr2k
perform one of the symmetric rank 2k operations C := alpha*A*B' + alpha*B*A' + beta*C,
dsyrfs
improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution
dsyrk
perform one of the symmetric rank k operations C := alpha*A*A' + beta*C,
dsysv
compute the solution to a real system of linear equations A * X = B,
dsysvx
use the diagonal pivoting factorization to compute the solution to a real system of linear equations A * X = B,
dsytd2
reduce a real symmetric matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation
dsytf2
compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
dsytrd
reduce a real symmetric matrix A to real symmetric tridiagonal form T by an orthogonal similarity transformation
dsytrf
compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
dsytri
compute the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF
dsytrs
solve a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF
dtbcon
estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
dtbmv
perform one of the matrix-vector operations x := A*x, or x := A'*x,
dtbrfs
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
dtbsv
solve one of the systems of equations A*x = b, or A'*x = b,
dtbtrs
solve a triangular system of the form A * X = B or A**T * X = B,
dtgevc
compute some or all of the right and/or left generalized eigenvectors of a pair of real upper triangular matrices (A,B)
dtgex2
swap adjacent diagonal blocks (A11, B11) and (A22, B22) of size 1-by-1 or 2-by-2 in an upper (quasi) triangular matrix pair (A, B) by an orthogonal equivalence transformation
dtgexc
reorder the generalized real Schur decomposition of a real matrix pair (A,B) using an orthogonal equivalence transformation (A, B) = Q * (A, B) * Z',
dtgsen
reorder the generalized real Schur decomposition of a real matrix pair (A, B) (in terms of an orthonormal equivalence trans- formation Q' * (A, B) * Z), so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix A and the upper triangular B
dtgsja
compute the generalized singular value decomposition (GSVD) of two real upper triangular (or trapezoidal) matrices A and B
dtgsna
estimate reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a matrix pair (A, B) in generalized real Schur canonical form (or of any matrix pair (Q*A*Z', Q*B*Z') with orthogonal matrices Q and Z, where Z' denotes the transpose of Z
dtgsy2
solve the generalized Sylvester equation
dtgsyl
solve the generalized Sylvester equation
DTMFDetect
DTMFDetect is used for detecting DTMF tones in a stream of audio.
dtpcon
estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
dtpmv
perform one of the matrix-vector operations x := A*x, or x := A'*x,