pbtf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
cpbtrf		cpbtrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
cpbtrs		cpbtrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite band matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPBTRF
cpoco		cpoco (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.
cpocon		cpocon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
cpodi		cpodi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC.
cpoequ		cpoequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the two-norm)
cpofa		cpofa (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.
cporfs		cporfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
cposl		cposl (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 and x.
cposv		cposv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cposvx		cposvx (3p)	- use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations  A * X = B,
cpotf2		cpotf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
cpotrf		cpotrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
cpotri		cpotri (3p)	- compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
cpotrs		cpotrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
cppco		cppco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage.  If the condition number is not needed then xPPFA is slightly faster.  It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
cppcon		cppcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite packed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
cppdi		cppdi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA.
cppequ		cppequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)
cppfa		cppfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage.  It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
cpprfs		cpprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward error estimates for the solution
cppsl		cppsl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x.
cppsv		cppsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cppsvx		cppsvx (3p)	- use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations  A * X = B,
cpptrf		cpptrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
cpptri		cpptri (3p)	- compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
cpptrs		cpptrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
cptcon		cptcon (3p)	- compute the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by CPTTRF
cpteqr		cpteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using SPTTRF and then calling CBDSQR to compute the singular values of the bidiagonal factor
cptrfs		cptrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution
cptsl		cptsl (3p)	- solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x.
cptsv		cptsv (3p)	- compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices
cptsvx		cptsvx (3p)	- use the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices
cpttrf		cpttrf (3p)	- compute the factorization of a complex Hermitian positive definite tridiagonal matrix A
cpttrs		cpttrs (3p)	- solve a system of linear equations A * X = B with a Hermitian positive definite tridiagonal matrix A using the factorization A = U**H*D*U or A = L*D*L**H computed by CPTTRF
cqrdc		cqrdc (3p)	- compute the QR factorization of a general matrix A.  It is typical to follow a  call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A.
cqrsl		cqrsl (3p)	- solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x.
crot		crot (3p)	- apply a plane rotation, where the cos (C) is real and the sin (S) is complex, and the vectors CX and CY are complex
crotg		crotg (3p)	- Construct a Given's plane rotation
cscal		cscal (3p)	- Compute y := alpha * y
csico		csico (3p)	- compute the UDU factorization and condition number of a symmetric matrix A.  If the condition number is not needed then xSIFA is slightly faster.  It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
csidi		csidi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA.
csifa		csifa (3p)	- compute the UDU factorization of a symmetric matrix A.  It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
csisl		csisl (3p)	- solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x.
cspco		cspco (3p)	- compute the UDU factorization and condition number of a symmetric matrix A in packed storage.  If the condition number is not needed then xSPFA is slightly faster.  It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
cspcon		cspcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF
cspdi		cspdi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA.
cspfa		cspfa (3p)	- compute the UDU factorization of a symmetric matrix A in packed storage.  It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
cspmv		cspmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
cspr		cspr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*conjg( x' ) + A,
csprfs		csprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution
cspsl		cspsl (3p)	- solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x.
cspsv		cspsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cspsvx		cspsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices
csptrf		csptrf (3p)	- compute the factorization of a complex symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method
csptri		csptri (3p)	- compute the inverse of a complex symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF
csptrs		csptrs (3p)	- solve a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF
csrot		csrot (3p)	- Apply a Given's rotation constructed by SROTG.
csrscl		csrscl (3p)	- multiply an n-element complex vector x by the real scalar 1/a
csscal		csscal (3p)	- Compute y := alpha * y
cstedc		cstedc (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
cstein		cstein (3p)	- compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
csteqr		csteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
csvdc		csvdc (3p)	- compute the singular value decomposition of a general matrix A.
cswap		cswap (3p)	- Exchange vectors x and y.
csycon		csycon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF
csymm		csymm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
csymv		csymv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
csyr		csyr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*( x' ) + A,
csyr2k		csyr2k (3p)	- perform one of the symmetric rank 2k operations   C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C
csyrfs		csyrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution
csyrk		csyrk (3p)	- perform one of the symmetric rank k operations   C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C
csysv		csysv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
csysvx		csysvx (3p)	- use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
csytf2		csytf2 (3p)	- compute the factorization of a complex symmetric matrix Aatrix-vector operation	y := alpha*A*x + beta*y
chpr		chpr (3p)	- perform the hermitian rank 1 operation   A := alpha*x*conjg( x' ) + A
chpr2		chpr2 (3p)	- perform the Hermitian rank 2 operation   A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A
chprfs		chprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite and packed, and provides error bounds and backward error estimates for the solution
chpsl		chpsl (3p)	- solve the linear system Ax = b for a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA, and vectors b and x.
chpsv		chpsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
chpsvx		chpsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**H or A = L*D*L**H to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian matrix stored in packed format and X and B are N-by-NRHS matrices
chptrd		chptrd (3p)	- reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation
chptrf		chptrf (3p)	- compute the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method
chptri		chptri (3p)	- compute the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF
chptrs		chptrs (3p)	- solve a system of linear equations A*X = B with a complex Hermitian matrix A stored in packed format using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF
chsein		chsein (3p)	- use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H
chseqr		chseqr (3p)	- compute the eigenvalues of a complex upper Hessenberg matrix H, and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**H, where T is an upper triangular matrix (the Schur form), and Z is the unitary matrix of Schur