- solve a system of linear equations  A * X = B, A**T * X = B, or A**H * X = B with a general N-by-N matrix A using the LU factorization computed by ZGETRF
zggbak		zggbak (3p)	- form the right or left eigenvectors of a complex generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by ZGGBAL
zggbal		zggbal (3p)	- balance a pair of general complex matrices (A,B)
zggglm		zggglm (3p)	- solve a general Gauss-Markov linear model (GLM) problem
zgghrd		zgghrd (3p)	- reduce a pair of complex matrices (A,B) to generalized upper Hessenberg form using unitary transformations, where A is a general matrix and B is upper triangular
zgglse		zgglse (3p)	- solve the linear equality-constrained least squares (LSE) problem
zggqrf		zggqrf (3p)	- compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
zggrqf		zggrqf (3p)	- compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
zggsvd		zggsvd (3p)	- compute the generalized singular value decomposition (GSVD) of an M-by-N complex matrix A and P-by-N complex matrix B
zggsvp		zggsvp (3p)	- compute unitary matrices U, V and Q such that   N-K-L K L  U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0
zgtcon		zgtcon (3p)	- estimate the reciprocal of the condition number of a complex tridiagonal matrix A using the LU factorization as computed by ZGTTRF
zgtrfs		zgtrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
zgtsl		zgtsl (3p)	- solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x.
zgtsv		zgtsv (3p)	- solve the equation   A*X = B,
zgtsvx		zgtsvx (3p)	- use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
zgttrf		zgttrf (3p)	- compute an LU factorization of a complex tridiagonal matrix A using elimination with partial pivoting and row interchanges
zgttrs		zgttrs (3p)	- solve one of the systems of equations  A * X = B, A**T * X = B, or A**H * X = B,
zhbev		zhbev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevd		zhbevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevx		zhbevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbgst		zhbgst (3p)	- reduce a complex Hermitian-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y,
zhbgv		zhbgv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
zhbmv		zhbmv (3p)	- perform the matrix-vector operation y := alpha*A*x + beta*y
zhbtrd		zhbtrd (3p)	- reduce a complex Hermitian band matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhecon		zhecon (3p)	- estimate the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zheev		zheev (3p)	- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevd		zheevd (3p)	- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevx		zheevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zhegs2		zhegs2 (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegst		zhegst (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegv		zhegv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
zhemm		zhemm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
zhemv		zhemv (3p)	- perform the matrix-vector operation y := alpha*A*x + beta*y
zher		zher (3p)	- perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A
zher2		zher2 (3p)	- perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A
zher2k		zher2k (3p)	- perform one of the hermitian rank 2k operations   C := alpha*A*conjg( B' ) + conjg( alpha )*B*conjg( A' ) + beta*C or C := alpha*conjg( A' )*B + conjg( alpha )*conjg( B' )*A + beta*C
zherfs		zherfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates for the solution
zherk		zherk (3p)	- perform one of the hermitian rank k operations C := alpha*A*conjg( A' ) + beta*C or C := alpha*conjg( A' )*A + beta*C
zhesv		zhesv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zhesvx		zhesvx (3p)	- use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
zhetd2		zhetd2 (3p)	- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetf2		zhetf2 (3p)	- compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetrd		zhetrd (3p)	- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetrf		zhetrf (3p)	- compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetri		zhetri (3p)	- compute the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zhetrs		zhetrs (3p)	- solve a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zhico		zhico (3p)	- compute the UDU factorization and condition number of a Hermitian matrix A.  If the condition number is not needed then xHIFA is slightly faster.  It is typical to follow a call to xHICO with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A.
zhidi		zhidi (3p)	- compute the determinant, inertia, and inverse of a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA.
zhifa		zhifa (3p)	- compute the UDU factorization of a Hermitian matrix A.  It is typical to follow a call to xHIFA with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A.
zhisl		zhisl (3p)	- solve the linear system Ax = b for a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA, and vectors b and x.
zhpco		zhpco (3p)	- compute the UDU factorization and condition number of a Hermitian matrix A in packed storage.  If the condition number is not needed then xHPFA is slightly faster.  It is typical to follow a call to xHPCO with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A.
zhpcon		zhpcon (3p)	- estimate the reciprocal of the condition number of a complex Hermitian packed matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF
zhpdi		zhpdi (3p)	- compute the determinant, inertia, and inverse of a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA.
zhpev		zhpev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage
zhpevd		zhpevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
zhpevx		zhpevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
zhpfa		zhpfa (3p)	- compute the UDU factorization of a Hermitian matrix A in packed storage. It is typical to follow a call to xHPFA with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A.
zhpgst		zhpgst (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage
zhpgv		zhpgv (3p)	- compute all the eigenvalues and, optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
zhpmv		zhpmv (3p)	- perform the matrix-vector operation y := alpha*A*x + beta*y
zhpr		zhpr (3p)	- perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A
zhpr2		zhpr2 (3p)	- perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A
zhprfs		zhprfs (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
zhpsl		zhpsl (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.
zhpsv		zhpsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zhpsvx		zhpsvx (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
zhptrd		zhptrd (3p)	- reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation
zhptrf		zhptrf (3p)	- compute the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method
zhptri		zhptri (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 ZHPTRF
zhptrs		zhptrs (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 ZHPTRF
zhsein		zhsein (3p)	- use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hess