N1 by N2 matrix X, 1 <= N1,N2 <= 2, in	 op(TL)*X + ISGN*X*op(TR) = SCALE*B,
slasyf		slasyf (3p)	- compute a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
slatbs		slatbs (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow, where A is an upper or lower triangular band matrix
slatps		slatps (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow, where A is an upper or lower triangular matrix stored in packed form
slatrd		slatrd (3p)	- reduce NB rows and columns of a real symmetric matrix A to symmetric tridiagonal form by an orthogonal similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A
slatrs		slatrs (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow
slatzm		slatzm (3p)	- applie a Householder matrix generated by STZRQF to a matrix
slauu2		slauu2 (3p)	- compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A
slauum		slauum (3p)	- compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A
snrm2		snrm2 (3p)	- Return the Euclidian norm of a vector.
sopgtr		sopgtr (3p)	- generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by SSPTRD using packed storage
sopmtr		sopmtr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sorg2l		sorg2l (3p)	- generate an m by n real matrix Q with orthonormal columns,
sorg2r		sorg2r (3p)	- generate an m by n real matrix Q with orthonormal columns,
sorgbr		sorgbr (3p)	- generate one of the real orthogonal matrices Q or P**T determined by SGEBRD when reducing a real matrix A to bidiagonal form
sorghr		sorghr (3p)	- generate a real orthogonal matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by SGEHRD
sorgl2		sorgl2 (3p)	- generate an m by n real matrix Q with orthonormal rows,
sorglq		sorglq (3p)	- generate an M-by-N real matrix Q with orthonormal rows,
sorgql		sorgql (3p)	- generate an M-by-N real matrix Q with orthonormal columns,
sorgqr		sorgqr (3p)	- generate an M-by-N real matrix Q with orthonormal columns,
sorgr2		sorgr2 (3p)	- generate an m by n real matrix Q with orthonormal rows,
sorgrq		sorgrq (3p)	- generate an M-by-N real matrix Q with orthonormal rows,
sorgtr		sorgtr (3p)	- generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by SSYTRD
sorm2l		sorm2l (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sorm2r		sorm2r (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sormbr		sormbr (3p)	- VECT = 'Q', SORMBR overwrites the general real M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormhr		sormhr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sorml2		sorml2 (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sormlq		sormlq (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormql		sormql (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormqr		sormqr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormr2		sormr2 (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sormrq		sormrq (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormtr		sormtr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
spbco		spbco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage.  If the condition number is not needed then xPBFA is slightly faster.  It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
spbcon		spbcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite band matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF
spbdi		spbdi (3p)	- compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA.
spbequ		spbequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm)
spbfa		spbfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage.  It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
spbrfs		spbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and provides error bounds and backward error estimates for the solution
spbsl		spbsl (3p)	- section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x.
spbstf		spbstf (3p)	- compute a split Cholesky factorization of a real symmetric positive definite band matrix A
spbsv		spbsv (3p)	- compute the solution to a real system of linear equations  A * X = B,
spbsvx		spbsvx (3p)	- use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations	A * X = B,
spbtf2		spbtf2 (3p)	- compute the Cholesky factorization of a real symmetric positive definite band matrix A
spbtrf		spbtrf (3p)	- compute the Cholesky factorization of a real symmetric positive definite band matrix A
spbtrs		spbtrs (3p)	- solve a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF
spoco		spoco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A.  If the condition number is not needed then xPOFA is slightly faster.  It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
spocon		spocon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPOTRF
spodi		spodi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC.
spoequ		spoequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm)
spofa		spofa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A.  It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
sporfs		sporfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite,
sposl		sposl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b a