# Pages du manuel Linux : Fonctions des bibliothèques

dgeequ
compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
dgees
compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z
dgeesx
compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z
dgeev
compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
dgeevx
compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
dgegs
routine is deprecated and has been replaced by routine DGGES
dgegv
routine is deprecated and has been replaced by routine DGGEV
dgehd2
reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
dgehrd
reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
dgelq2
compute an LQ factorization of a real m by n matrix A
dgelqf
compute an LQ factorization of a real M-by-N matrix A
dgels
solve overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A
dgelsd
compute the minimum-norm solution to a real linear least squares problem
dgelss
compute the minimum norm solution to a real linear least squares problem
dgelsx
routine is deprecated and has been replaced by routine DGELSY
dgelsy
compute the minimum-norm solution to a real linear least squares problem
dgemm
perform one of the matrix-matrix operations C := alpha*op( A )*op( B ) + beta*C,
dgemv
perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y,
dgeql2
compute a QL factorization of a real m by n matrix A
dgeqlf
compute a QL factorization of a real M-by-N matrix A
dgeqp3
compute a QR factorization with column pivoting of a matrix A
dgeqpf
routine is deprecated and has been replaced by routine DGEQP3
dgeqr2
compute a QR factorization of a real m by n matrix A
dgeqrf
compute a QR factorization of a real M-by-N matrix A
dger
perform the rank 1 operation A := alpha*x*y' + A,
dgerfs
improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
dgerq2
compute an RQ factorization of a real m by n matrix A
dgerqf
compute an RQ factorization of a real M-by-N matrix A
dgesc2
solve a system of linear equations A * X = scale* RHS with a general N-by-N matrix A using the LU factorization with complete pivoting computed by DGETC2
dgesdd
compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and right singular vectors
dgesv
compute the solution to a real system of linear equations A * X = B,
dgesvd
compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and/or right singular vectors
dgesvx
use the LU factorization to compute the solution to a real system of linear equations A * X = B,
dgetc2
compute an LU factorization with complete pivoting of the n-by-n matrix A
dgetf2
compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges
dgetrf
compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
dgetri
compute the inverse of a matrix using the LU factorization computed by DGETRF
dgetrs
solve a system of linear equations A * X = B or A' * X = B with a general N-by-N matrix A using the LU factorization computed by DGETRF
dggbak
form the right or left eigenvectors of a real generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by DGGBAL
dggbal
balance a pair of general real matrices (A,B)
dgges
compute for a pair of N-by-N real nonsymmetric matrices (A,B),
dggesx
compute for a pair of N-by-N real nonsymmetric matrices (A,B), the generalized eigenvalues, the real Schur form (S,T), and,
dggev
compute for a pair of N-by-N real nonsymmetric matrices (A,B)
dggevx
compute for a pair of N-by-N real nonsymmetric matrices (A,B)
dggglm
solve a general Gauss-Markov linear model (GLM) problem
dgghrd
reduce a pair of real matrices (A,B) to generalized upper Hessenberg form using orthogonal transformations, where A is a general matrix and B is upper triangular
dgglse
solve the linear equality-constrained least squares (LSE) problem
dggqrf
compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
dggrqf
compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
dggsvd
compute the generalized singular value decomposition (GSVD) of an M-by-N real matrix A and P-by-N real matrix B