bsvx		dgbsvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
dgbtf2		dgbtf2 (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
dgbtrf		dgbtrf (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
dgbtrs		dgbtrs (3p)	- solve a system of linear equations  A * X = B or A' * X = B with a general band matrix A using the LU factorization computed by DGBTRF
dgebak		dgebak (3p)	- form the right or left eigenvectors of a real general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by DGEBAL
dgebal		dgebal (3p)	- balance a general real matrix A
dgebd2		dgebd2 (3p)	- reduce a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation
dgebrd		dgebrd (3p)	- reduce a general real M-by-N matrix A to upper or lower bidiagonal form B by an orthogonal transformation
dgeco		dgeco (3p)	- compute the LU factorization and estimate the condition number of a general matrix A.  If the condition number is not needed then xGEFA is slightly faster.  It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A.
dgecon		dgecon (3p)	- estimate the reciprocal of the condition number of a general real matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by DGETRF
dgedi		dgedi (3p)	- compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA.
dgeequ		dgeequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
dgees		dgees (3p)	- 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		dgeesx (3p)	- 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		dgeev (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
dgeevx		dgeevx (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
dgefa		dgefa (3p)	- compute the LU factorization of a general matrix A.  It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A.
dgegs		dgegs (3p)	- compute for a pair of N-by-N real nonsymmetric matrices A, B
dgegv		dgegv (3p)	- compute for a pair of n-by-n real nonsymmetric matrices A and B, the generalized eigenvalues (alphar +/- alphai*i, beta), and optionally, the left and/or right generalized eigenvectors (VL and VR)
dgehd2		dgehd2 (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
dgehrd		dgehrd (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
dgelq2		dgelq2 (3p)	- compute an LQ factorization of a real m by n matrix A
dgelqf		dgelqf (3p)	- compute an LQ factorization of a real M-by-N matrix A
dgels		dgels (3p)	- 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
dgelss		dgelss (3p)	- compute the minimum norm solution to a real linear least squares problem
dgelsx		dgelsx (3p)	- compute the minimum-norm solution to a real linear least squares problem
dgemm		dgemm (3p)	- perform one of the matrix-matrix operations	C := alpha*op( A )*op( B ) + beta*C
dgemv		dgemv (3p)	- perform one of the matrix-vector operations y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y
dgeql2		dgeql2 (3p)	- compute a QL factorization of a real m by n matrix A
dgeqlf		dgeqlf (3p)	- compute a QL factorization of a real M-by-N matrix A
dgeqpf		dgeqpf (3p)	- compute a QR factorization with column pivoting of a real M-by-N matrix A
dgeqr2		dgeqr2 (3p)	- compute a QR factorization of a real m by n matrix A
dgeqrf		dgeqrf (3p)	- compute a QR factorization of a real M-by-N matrix A
dger		dger (3p)	- perform the rank 1 operation	 A := alpha*x*y' + A
dgerfs		dgerfs (3p)	- improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
dgerq2		dgerq2 (3p)	- compute an RQ factorization of a real m by n matrix A
dgerqf		dgerqf (3p)	- compute an RQ factorization of a real M-by-N matrix A
dgesl		dgesl (3p)	- solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x.
dgesv		dgesv (3p)	- compute the solution to a real system of linear equations  A * X = B,
dgesvd		dgesvd (3p)	- compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and/or right singular vectors
dgesvx		dgesvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations  A * X = B,
dgetf2		dgetf2 (3p)	- compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges
dgetrf		dgetrf (3p)	- compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
dgetri		dgetri (3p)	- compute the inverse of a matrix using the LU factorization computed by DGETRF
dgetrs		dgetrs (3p)	- 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		dggbak (3p)	- 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		dggbal (3p)	- balance a pair of general real matrices (A,B)
dggglm		dggglm (3p)	- solve a general Gauss-Markov linear model (GLM) problem
dgghrd		dgghrd (3p)	- 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		dgglse (3p)	- solve the linear equality-constrained least squares (LSE) problem
dggqrf		dggqrf (3p)	- compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
dggrqf		dggrqf (3p)	- compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
dggsvd		dggsvd (3p)	- compute the generalized singular value decomposition (GSVD) of an M-by-N real matrix A and P-by-N real matrix B
dggsvp		dggsvp (3p)	- compute orthogonal matrices U, V and Q such that   N-K-L K L	U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0
dgtcon		dgtcon (3p)	- estimate the reciprocal of the condition number of a real tridiagonal matrix A using the LU factorization as computed by DGTTRF
dgtrfs		dgtrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
dgtsl		dgtsl (3p)	- solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x.
dgtsv		dgtsv (3p)	- solve the equation   A*X = B,
dgtsvx		dgtsvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations A * X = B or A**T * X = B,
dgttrf		dgttrf (3p)	- compute an LU factorization of a real tridiagonal matrix A using elimination with partial pivoting and row interchanges
dgttrs		dgttrs (3p)	- solve one of the systems of equations  A*X = B or A'*X = B,
dhsein		dhsein (3p)	- use inverse iteration to find specified right and/or left eigenvectors of a real upper Hessenberg matrix H
dhseqr		dhseqr (3p)	- compute the eigenvalues of a real upper Hessenberg matrix H and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**T, where T is an upper quasi-triangular matrix (the Schur form), and Z is the orthogonal matrix of Schur vectors
dlabad		dlabad (3p)	- take as input the values computed by SLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
dlabrd		dlabrd (3p)	- reduce the first NB rows and columns of a real general m by n matrix A to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A
dlacon		dlacon (3p)	- estimate the 1-norm of a square, real matrix A
dlacpy		dlacpy (3p)	- copie all or part of a two-dimensional matrix A to another matrix B
dlae2		dlae2 (3p)	- compute the eigenvalues of a 2-by-2 symmetric matrix	[ A B ]  [ B C ]
dlaebz		dlaebz (3p)	- contain the iteration loops which compute and use the function N(w), which is the count of eigenvalues of a symmetric tridiagonal matrix T less than or equal to its argument w
dlaed0		dlaed0 (3p)	- compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
dlaed1		dlaed1 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
dlaed2		dlaed2 (3p)	- merge the two sets of eigenvalues together into a single sorted set
dlaed3		dlaed3 (3p)	- find the roots of the secular equation, as defined by the values in D, W, and RHO, between KSTART and KSTOP
dlaed4		dlaed4 (3p)	- subroutine computes the I-th updated eigenvalue of a symmetric rank-one modification to a diagonal matrix whose elements are given in the array d, and that	D(i) < D(j) for i < j  and that RHO > 0
dlaed5		dlaed5 (3p)	- subroutine computes the I-th eigenvalue of a symmetric rank-one modification of a 2-by-2 diagonal matrix   diag( D ) + RHO  The diagonal elements in the array D are assumed to satisfy   D(i) < D(j) for i < j 
dlaed7		dlaed7 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
dlaed8		dlaed8 (3p)	- merge the two sets of eigenvalues together into a single sorted set
dlaed9		dlaed9 (3p)	- find the roots of the secular equation, as defined by the values in D, Z, and RHO, between KSTART and KSTOP
dlaeda		dlaeda (3p)	- compute the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem
dlaein		dlaein (3p)	- use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg matrix H
dlaev2		dlaev2 (3p)	- compute the eigendecomposition of a 2-by-2 symmetric matrix  [ A B ]	[ B C ]
dlaexc		dlaexc (3p)	- swap adjacent diagonal blocks T11 and T22 of order 1 or 2 in an upper quasi-triangular matrix T by an orthogonal similarity transformation
dlahqr		dlahqr (3p)	- i an auxiliary routine called by DHSEQR to update the eigenvalues and Schur decomposition already computed by DHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
dlahrd		dlahrd (3p)	- reduce the first NB columns of a real general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
dlaic1		dlaic1 (3p)	- applie one step of incremental condition estimation in its simplest version
dlamch		dlamch (3p)	- determine double precision machine parameters
dlamrg		dlamrg (3p)	- will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order
dlangb		dlangb (3p)	- 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
dlange		dlange (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real matrix A
dlangt		dlangt (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real tridiagonal matrix A
dlanhs		dlanhs (3p)	- 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
dlansb		dlansb (3p)	- return the value of the one norm, or the Frobenius nor