inite 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.
zppcon		zppcon (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 ZPPTRF
zppdi		zppdi (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.
zppequ		zppequ (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)
zppfa		zppfa (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.
zpprfs		zpprfs (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
zppsl		zppsl (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.
zppsv		zppsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zppsvx		zppsvx (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,
zpptrf		zpptrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
zpptri		zpptri (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 ZPPTRF
zpptrs		zpptrs (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 ZPPTRF
zptcon		zptcon (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 ZPTTRF
zpteqr		zpteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF and then calling ZBDSQR to compute the singular values of the bidiagonal factor
zptrfs		zptrfs (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
zptsl		zptsl (3p)	- solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x.
zptsv		zptsv (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
zptsvx		zptsvx (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
zpttrf		zpttrf (3p)	- compute the factorization of a complex Hermitian positive definite tridiagonal matrix A
zpttrs		zpttrs (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 ZPTTRF
zqrdc		zqrdc (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.
zqrsl		zqrsl (3p)	- solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x.
zrot		zrot (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
zrotg		zrotg (3p)	- Construct a Given's plane rotation
zscal		zscal (3p)	- Compute y := alpha * y
zsico		zsico (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.
zsidi		zsidi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA.
zsifa		zsifa (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.
zsisl		zsisl (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.
zspco		zspco (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.
zspcon		zspcon (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 ZSPTRF
zspdi		zspdi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA.
zspfa		zspfa (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.
zspmv		zspmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
zspr		zspr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*conjg( x' ) + A,
zsprfs		zsprfs (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
zspsl		zspsl (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.
zspsv		zspsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zspsvx		zspsvx (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
zsptrf		zsptrf (3p)	- compute the factorization of a complex symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method
zsptri		zsptri (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 ZSPTRF
zsptrs		zsptrs (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 ZSPTRF
zstedc		zstedc (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
zstein		zstein (3p)	- compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
zsteqr		zsteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
zsvdc		zsvdc (3p)	- compute the singular value decomposition of a general matrix A.
zswap		zswap (3p)	- Exchange vectors x and y.
zsycon		zsycon (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 ZSYTRF
zsymm		zsymm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
zsymv		zsymv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
zsyr		zsyr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*( x' ) + A,
zsyr2k		zsyr2k (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
zsyrfs		zsyrfs (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
zsyrk		zsyrk (3p)	- perform one of the symmetric rank k operations   C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C
zsysv		zsysv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zsysvx		zsysvx (3p)	- use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
zsytf2		zsytf2 (3p)	- compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
zsytrf		zsytrf (3p)	- compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
zsytri		zsytri (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 ZSYTRF
zsytrs		zsytrs (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 ZSYTRF
ztbcon		ztbcon (3p)	- estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
ztbmv		ztbmv (3p)	- perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x
ztbrfs		ztbrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with