- zppsv
 
        - 
compute the solution to a complex system of linear equations A * X = B,
 
                    - zppsvx
 
        - 
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
 
        - 
compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
 
                    - zpptri
 
        - 
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
 
        - 
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
 
        - 
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
 
        - 
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
 
        - 
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
 
                    - zptsv
 
        - 
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
 
        - 
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
 
        - 
compute the L*D*L' factorization of a complex Hermitian positive definite tridiagonal matrix A
 
                    - zpttrs
 
        - 
solve a tridiagonal system of the form A * X = B using the factorization A = U'*D*U or A = L*D*L' computed by ZPTTRF
 
                    - zpttrsv
 
        - 
solve one of the triangular systems  L * X = B, or L**H * X = B,
 
                    - zptts2
 
        - 
solve a tridiagonal system of the form A * X = B using the factorization A = U'*D*U or A = L*D*L' computed by ZPTTRF
 
                    - zrot
 
        - 
applie a plane rotation, where the cos (C) is real and the sin (S) is complex, and the vectors CX and CY are complex
 
                    - zrotg
 
        - 
construct givens plane rotation
 
                    - zscal
 
        - 
scales a vector by a constant.
 
                    - zspcon
 
        - 
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
 
                    - zspmv
 
        - 
perform the matrix-vector operation  y := alpha*A*x + beta*y,
 
                    - zspr
 
        - 
perform the symmetric rank 1 operation  A := alpha*x*conjg( x' ) + A,
 
                    - zsprfs
 
        - 
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
 
                    - zspsv
 
        - 
compute the solution to a complex system of linear equations A * X = B,
 
                    - zspsvx
 
        - 
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
 
        - 
compute the factorization of a complex symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method
 
                    - zsptri
 
        - 
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
 
        - 
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
 
        - 
compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
 
                    - zstegr
 
        - 
compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix T
 
                    - zstein
 
        - 
compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
 
                    - zsteqr
 
        - 
compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
 
                    - zstream.h
 
        - 
compressed stream operations.
 
                    - zsycon
 
        - 
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
 
        - 
perform one of the matrix-matrix operations   C := alpha*A*B + beta*C,
 
                    - zsymv
 
        - 
perform the matrix-vector operation  y := alpha*A*x + beta*y,
 
                    - zsyr
 
        - 
perform the symmetric rank 1 operation  A := alpha*x*( x' ) + A,
 
                    - zsyr2k
 
        - 
perform one of the symmetric rank 2k operations   C := alpha*A*B' + alpha*B*A' + beta*C,
 
                    - zsyrfs
 
        - 
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
 
        - 
perform one of the symmetric rank k operations   C := alpha*A*A' + beta*C,
 
                    - zsysv
 
        - 
compute the solution to a complex system of linear equations A * X = B,
 
                    - zsysvx
 
        - 
use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
 
                    - zsytf2
 
        - 
compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
 
                    - zsytrf
 
        - 
compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
 
                    - zsytri
 
        - 
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
 
        - 
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
 
        - 
estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
 
                    - ztbmv
 
        - 
perform one of the matrix-vector operations   x := A*x, or x := A'*x, or x := conjg( A' )*x,
 
                    - ztbrfs
 
        - 
provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
 
                    - ztbsv
 
        - 
solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b,
 
                    - ztbtrs
 
        - 
solve a triangular system of the form  A * X = B, A**T * X = B, or A**H * X = B,
 
                    - ztgevc
 
        - 
compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B)