a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation
sgbco		sgbco (3p)	- compute the LU factorization and condition number of a general matrix A in banded storage.  If the condition number is not needed then xGBFA is slightly faster.  It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
sgbcon		sgbcon (3p)	- estimate the reciprocal of the condition number of a real general band matrix A, in either the 1-norm or the infinity-norm,
sgbdi		sgbdi (3p)	- compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA.
sgbequ		sgbequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number
sgbfa		sgbfa (3p)	- compute the LU factorization of a matrix A in banded storage.  It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
sgbmv		sgbmv (3p)	- perform one of the matrix-vector operations	y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y
sgbrfs		sgbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution
sgbsl		sgbsl (3p)	- solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x.
sgbsv		sgbsv (3p)	- compute the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices
sgbsvx		sgbsvx (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,
sgbtf2		sgbtf2 (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
sgbtrf		sgbtrf (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
sgbtrs		sgbtrs (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 SGBTRF
sgebak		sgebak (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 SGEBAL
sgebal		sgebal (3p)	- balance a general real matrix A
sgebd2		sgebd2 (3p)	- reduce a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation
sgebrd		sgebrd (3p)	- reduce a general real M-by-N matrix A to upper or lower bidiagonal form B by an orthogonal transformation
sgeco		sgeco (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.
sgecon		sgecon (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 SGETRF
sgedi		sgedi (3p)	- compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA.
sgeequ		sgeequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
sgees		sgees (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
sgeesx		sgeesx (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
sgeev		sgeev (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
sgeevx		sgeevx (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
sgefa		sgefa (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.
sgegs		sgegs (3p)	- compute for a pair of N-by-N real nonsymmetric matrices A, B
sgegv		sgegv (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)
sgehd2		sgehd2 (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
sgehrd		sgehrd (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
sgelq2		sgelq2 (3p)	- compute an LQ factorization of a real m by n matrix A
sgelqf		sgelqf (3p)	- compute an LQ factorization of a real M-by-N matrix A
sgels		sgels (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
sgelss		sgelss (3p)	- compute the minimum norm solution to a real linear least squares problem
sgelsx		sgelsx (3p)	- compute the minimum-norm solution to a real linear least squares problem
sgemm		sgemm (3p)	- perform one of the matrix-matrix operations	C := alpha*op( A )*op( B ) + beta*C
sgemv		sgemv (3p)	- perform one of the matrix-vector operations	y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y
sgeql2		sgeql2 (3p)	- compute a QL factorization of a real m by n matrix A
sgeqlf		sgeqlf (3p)	- compute a QL factorization of a real M-by-N matrix A
sgeqpf		sgeqpf (3p)	- compute a QR factorization with column pivoting of a real M-by-N matrix A
sgeqr2		sgeqr2 (3p)	- compute a QR factorization of a real m by n matrix A
sgeqrf		sgeqrf (3p)	- compute a QR factorization of a real M-by-N matrix A
sger		sger (3p)	- perform the rank 1 operation	 A := alpha*x*y' + A
sgerfs		sgerfs (3p)	- improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for