(3p)	- compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA.
zpbequ		zpbequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite band matrix A and reduce its condition number (with respect to the two-norm)
zpbfa		zpbfa (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.
zpbrfs		zpbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and banded, and provides error bounds and backward error estimates for the solution
zpbsl		zpbsl (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.
zpbstf		zpbstf (3p)	- compute a split Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbsv		zpbsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zpbsvx		zpbsvx (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,
zpbtf2		zpbtf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrf		zpbtrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrs		zpbtrs (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 ZPBTRF
zpoco		zpoco (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.
zpocon		zpocon (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 ZPOTRF
zpodi		zpodi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC.
zpoequ		zpoequ (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)
zpofa		zpofa (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.
zporfs		zporfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
zposl		zposl (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.
zposv		zposv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zposvx		zposvx (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,
zpotf2		zpotf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotrf		zpotrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotri		zpotri (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 ZPOTRF
zpotrs		zpotrs (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 ZPOTRF
zppco		zppco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive defenberg matrix H
zhseqr		zhseqr (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 vectors
zlabrd		zlabrd (3p)	- reduce the first NB rows and columns of a complex general m by n matrix A to upper or lower real bidiagonal form by a unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A
zlacgv		zlacgv (3p)	- conjugate a complex vector of length N
zlacon		zlacon (3p)	- estimate the 1-norm of a square, complex matrix A
zlacpy		zlacpy (3p)	- copie all or part of a two-dimensional matrix A to another matrix B
zlacrm		zlacrm (3p)	- perform a very simple matrix-matrix multiplication
zlacrt		zlacrt (3p)	- applie a plane rotation, where the cos and sin (C and S) are complex and the vectors CX and CY are complex
zladiv		zladiv (3p)	- := X / Y, where X and Y are complex
zlaed0		zlaed0 (3p)	- the divide and conquer method, ZLAED0 computes all eigenvalues of a symmetric tridiagonal matrix which is one diagonal block of those from reducing a dense or band Hermitian matrix and corresponding eigenvectors of the dense or band matrix
zlaed7		zlaed7 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
zlaed8		zlaed8 (3p)	- merge the two sets of eigenvalues together into a single sorted set
zlaein		zlaein (3p)	- use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H
zlaesy		zlaesy (3p)	- compute the eigendecomposition of a 2-by-2 symmetric matrix  ( ( A, B );( B, C ) ) provided the norm of the matrix of eigenvectors is larger than some threshold value
zlaev2		zlaev2 (3p)	- compute the eigendecomposition of a 2-by-2 Hermitian matrix  [ A B ]	[ CONJG(B) C ]
zlags2		zlags2 (3p)	- compute 2-by-2 unitary matrices U, V and Q, such that