using the Bunch-Kaufman diagonal pivoting method
csytrf		csytrf (3p)	- compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
csytri		csytri (3p)	- compute the inverse of a complex symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF
csytrs		csytrs (3p)	- solve a system of linear equations A*X = B with a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF
ctbcon		ctbcon (3p)	- estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
ctbmv		ctbmv (3p)	- perform one of the matrix-vector operations	x := A*x, or x := A'*x, or x := conjg( A' )*x
ctbrfs		ctbrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
ctbsv		ctbsv (3p)	- solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b
ctbtrs		ctbtrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ctgevc		ctgevc (3p)	- compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B)
ctgsja		ctgsja (3p)	- compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B
ctpcon		ctpcon (3p)	- estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
ctpmv		ctpmv (3p)	- perform one of the matrix-vector operations	x := A*x, or x := A'*x, or x := conjg( A' )*x
ctprfs		ctprfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
ctpsv		ctpsv (3p)	- solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b
ctptri		ctptri (3p)	- compute the inverse of a complex upper or lower triangular matrix A stored in packed format
ctptrs		ctptrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ctrco		ctrco (3p)	- estimate the condition number of a triangular matrix A.  It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A.
ctrcon		ctrcon (3p)	- estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
ctrdi		ctrdi (3p)	- compute the determinant and inverse of a triangular matrix A.
ctrevc		ctrevc (3p)	- compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T
ctrexc		ctrexc (3p)	- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row index IFST is moved to row ILST
ctrmm		ctrmm (3p)	- perform one of the matrix-matrix operations	B := alpha*op( A )*B, or B := alpha*B*op( A )  where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of   op( A ) = A or op( A ) = A' or op( A ) = conjg( A' )
ctrmv		ctrmv (3p)	- perform one of the matrix-vector operations	x := A*x, or x := A'*x, or x := conjg( A' )*x
ctrrfs		ctrrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
ctrsen		ctrsen (3p)	- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in the leading positions on the diagonal of the upper triangular matrix T, and the leading columns of Q form an orthonormal basis of the corresponding right invariant subspace
ctrsl		ctrsl (3p)	- solve the linear system Ax = b for a triangular matrix A and vectors b and x.
ctrsm		ctrsm (3p)	- solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B
ctrsna		ctrsna (3p)	- estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper triangular matrix T (or of any matrix Q*T*Q**H with Q unitary)
ctrsv		ctrsv (3p)	- solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b
ctrsyl		ctrsyl (3p)	- solve the complex Sylvester matrix equation
ctrti2		ctrti2 (3p)	- compute the inverse of a complex upper or lower triangular matrix
ctrtri		ctrtri (3p)	- compute the inverse of a complex upper or lower triangular matrix A
ctrtrs		ctrtrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ctzrqf		ctzrqf (3p)	- reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations
cung2l		cung2l (3p)	- generate an m by n complex matrix Q with orthonormal columns,
cung2r		cung2r (3p)	- generate an m by n complex matrix Q with orthonormal columns,
cungbr		cungbr (3p)	- generate one of the complex unitary matrices Q or P**H determined by CGEBRD when reducing a complex matrix A to bidiagonal form
cunghr		cunghr (3p)	- generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by CGEHRD
cungl2		cungl2 (3p)	- generate an m-by-n complex matrix Q with orthonormal rows,
cunglq		cunglq (3p)	- generate an M-by-N complex matrix Q with orthonormal rows,
cungql		cungql (3p)	- generate an M-by-N complex matrix Q with orthonormal columns,
cungqr		cungqr (3p)	- generate an M-by-N complex matrix Q with orthonormal columns,
cungr2		cungr2 (3p)	- generate an m by n complex matrix Q with orthonormal rows,
cungrq		cungrq (3p)	- generate an M-by-N complex matrix Q with orthonormal rows,
cungtr		cungtr (3p)	- generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by CHETRD
cunm2l		cunm2l (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunm2r		cunm2r (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunmbr		cunmbr (3p)	- VECT = 'Q', CUNMBR overwrites the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmhr		cunmhr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunml2		cunml2 (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunmlq		cunmlq (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmql		cunmql (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmqr		cunmqr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmr2		cunmr2 (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunmrq		cunmrq (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmtr		cunmtr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cupgtr		cupgtr (3p)	- generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by CHPTRD using packed storage
cupmtr		cupmtr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dasum		dasum (3p)	- Return the sum of the absolute values of a vector x.
daxpy		daxpy (3p)	- Compute y := alpha * x + y
dbdsqr		dbdsqr (3p)	- compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B
dchdc		dchdc (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
dchdd		dchdd (3p)	- downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
dchex		dchex (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
dchud		dchud (3p)	- update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
dcopy		dcopy (3p)	- Copy x to y
dcosqb		dcosqb (3p)	- synthesize a Fourier sequence from its representation in terms of a cosine  series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call  to xCOSQB will multiply the input sequence by 4 * N.	The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
dcosqf		dcosqf (3p)	- compute the Fourier coefficients in a cosine series representation with only	odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call	to xCOSQB will multiply the input sequence by 4 * N.  The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
dcosqi		dcosqi (3p)	- initialize the array xWSAVE, which is used in both xCOSQF and  xCOSQB.
dcosti		dcosti (3p)	- initialize the array xWSAVE, which is used in xCOST.
ddisna		ddisna (3p)	- compute the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general m-by-n matrix
ddot		ddot (3p)	- Compute the dot product of two vectors x and y.
dfftb		dfftb (3p)	- compute a perodic sequence from its Fourier coefficients.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
dfftf		dfftf (3p)	- compute the Fourier coefficients of a perodic sequence.  T