- zgebrd
-
reduce a general complex M-by-N matrix A to upper or lower bidiagonal form B by a unitary transformation
- zgecon
-
estimate the reciprocal of the condition number of a general complex matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by ZGETRF
- zgeequ
-
compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
- zgees
-
compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z
- zgeesx
-
compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z
- zgeev
-
compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
- zgeevx
-
compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
- zgegs
-
routine is deprecated and has been replaced by routine ZGGES
- zgegv
-
routine is deprecated and has been replaced by routine ZGGEV
- zgehd2
-
reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation
- zgehrd
-
reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation
- zgelq2
-
compute an LQ factorization of a complex m by n matrix A
- zgelqf
-
compute an LQ factorization of a complex M-by-N matrix A
- zgels
-
solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix A, or its conjugate-transpose, using a QR or LQ factorization of A
- zgelsd
-
compute the minimum-norm solution to a real linear least squares problem
- zgelss
-
compute the minimum norm solution to a complex linear least squares problem
- zgelsx
-
routine is deprecated and has been replaced by routine ZGELSY
- zgelsy
-
compute the minimum-norm solution to a complex linear least squares problem
- zgemm
-
perform one of the matrix-matrix operations C := alpha*op( A )*op( B ) + beta*C,
- zgemv
-
perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or y := alpha*conjg( A' )*x + beta*y,
- zgeql2
-
compute a QL factorization of a complex m by n matrix A
- zgeqlf
-
compute a QL factorization of a complex M-by-N matrix A
- zgeqp3
-
compute a QR factorization with column pivoting of a matrix A
- zgeqpf
-
routine is deprecated and has been replaced by routine ZGEQP3
- zgeqr2
-
compute a QR factorization of a complex m by n matrix A
- zgeqrf
-
compute a QR factorization of a complex M-by-N matrix A
- zgerc
-
perform the rank 1 operation A := alpha*x*conjg( y' ) + A,
- zgerfs
-
improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
- zgerq2
-
compute an RQ factorization of a complex m by n matrix A
- zgerqf
-
compute an RQ factorization of a complex M-by-N matrix A
- zgeru
-
perform the rank 1 operation A := alpha*x*y' + A,
- zgesc2
-
solve a system of linear equations A * X = scale* RHS with a general N-by-N matrix A using the LU factorization with complete pivoting computed by ZGETC2
- zgesdd
-
compute the singular value decomposition (SVD) of a complex M-by-N matrix A, optionally computing the left and/or right singular vectors, by using divide-and-conquer method
- zgesv
-
compute the solution to a complex system of linear equations A * X = B,
- zgesvd
-
compute the singular value decomposition (SVD) of a complex M-by-N matrix A, optionally computing the left and/or right singular vectors
- zgesvx
-
use the LU factorization to compute the solution to a complex system of linear equations A * X = B,
- zgetc2
-
compute an LU factorization, using complete pivoting, of the n-by-n matrix A
- zgetf2
-
compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges
- zgetrf
-
compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
- zgetri
-
compute the inverse of a matrix using the LU factorization computed by ZGETRF
- zgetrs
-
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
-
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
-
balance a pair of general complex matrices (A,B)
- zgges
-
compute for a pair of N-by-N complex nonsymmetric matrices (A,B), the generalized eigenvalues, the generalized complex Schur form (S, T), and optionally left and/or right Schur vectors (VSL and VSR)
- zggesx
-
compute for a pair of N-by-N complex nonsymmetric matrices (A,B), the generalized eigenvalues, the complex Schur form (S,T),
- zggev
-
compute for a pair of N-by-N complex nonsymmetric matrices (A,B), the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors
- zggevx
-
compute for a pair of N-by-N complex nonsymmetric matrices (A,B) the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors
- zggglm
-
solve a general Gauss-Markov linear model (GLM) problem
- zgghrd
-
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
-
solve the linear equality-constrained least squares (LSE) problem