If you need to make conference calls for your business, consider enlisting the aid of a professional teleconferencing service. It doesn't have to be major expense because you sign up for free conference calling with a reliable company online.

Linux Manual Pages - section 3 (library calls)

_ | a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z |
Displaying 392 of 18427
zbdsqr - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B
ZBUFFER - ZBUFFER
zdbtf2 - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting with row interchanges
zdbtrf - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting or row interchanges
zdrot - applies a plane rotation, where the cos and sin (c and s) are real and the vectors cx and cy are complex.
zdrscl - multiplie an n-element complex vector x by the real scalar 1/a
zdttrf - compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
zdttrsv - solve one of the systems of equations  L * X = B, L**T * X = B, or L**H * X = B,
zgbbrd - reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation
zgbcon - estimate the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm,
zgbequ - compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number
zgbmv - 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,
zgbrfs - improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution
zgbsv - compute the solution to a complex system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices
zgbsvx - 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,
zgbtf2 - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
zgbtrf - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
zgbtrs - solve a system of linear equations A * X = B, A**T * X = B, or A**H * X = B with a general band matrix A using the LU factorization computed by ZGBTRF
zgebak - form the right or left eigenvectors of a complex general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by ZGEBAL
zgebal - balance a general complex matrix A
zgebd2 - reduce a complex general m by n matrix A to upper or lower real bidiagonal form B by a unitary transformation
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
zggqrf - compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
zggrqf - compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
zggsvd - compute the generalized singular value decomposition (GSVD) of an M-by-N complex matrix A and P-by-N complex matrix B
zggsvp - 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 - estimate the reciprocal of the condition number of a complex tridiagonal matrix A using the LU factorization as computed by ZGTTRF
zgtrfs - 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
zgtsv - solve the equation  A*X = B,
zgtsvx - 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 - compute an LU factorization of a complex tridiagonal matrix A using elimination with partial pivoting and row interchanges
zgttrs - solve one of the systems of equations A * X = B, A**T * X = B, or A**H * X = B,
zgtts2 - solve one of the systems of equations A * X = B, A**T * X = B, or A**H * X = B,
zhbev - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevd - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevx - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbgst - reduce a complex Hermitian-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y,
zhbgv - compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
zhbgvd - compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
zhbgvx - 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 - perform the matrix-vector operation   y := alpha*A*x + beta*y,
zhbtrd - reduce a complex Hermitian band matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhecon - 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 - compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevd - compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevr - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix T
zheevx - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zhegs2 - reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegst - reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegv - 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
zhegvd - 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
zhegvx - compute selected eigenvalues, and optionally, 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 - perform one of the matrix-matrix operations   C := alpha*A*B + beta*C,
zhemv - perform the matrix-vector operation   y := alpha*A*x + beta*y,
zher - perform the hermitian rank 1 operation   A := alpha*x*conjg( x' ) + A,
zher2 - perform the hermitian rank 2 operation   A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A,
zher2k - perform one of the hermitian rank 2k operations   C := alpha*A*conjg( B' ) + conjg( alpha )*B*conjg( A' ) + beta*C,
zherfs - 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 - perform one of the hermitian rank k operations   C := alpha*A*conjg( A' ) + beta*C,
zhesv - compute the solution to a complex system of linear equations A * X = B,
zhesvx - use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
zhetd2 - reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetf2 - compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetrd - reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetrf - compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetri - 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 - 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
zhgeqz - implement a single-w(i) B ) = 0  If JOB='S', then the pair (A,B) is simultaneously reduced to Schur form (i.e., A and B are both upper triangular) by applying one unitary tranformation (usually called Q) on the left and another (usually called Z) on the right
zhpcon - 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
zhpev - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage
zhpevd - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
zhpevx - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
zhpgst - reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage
zhpgv - 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
zhpgvd - 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
zhpgvx - compute selected eigenvalues and, optionally, 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 - perform the matrix-vector operation   y := alpha*A*x + beta*y,
zhpr - perform the hermitian rank 1 operation   A := alpha*x*conjg( x' ) + A,
zhpr2 - perform the hermitian rank 2 operation   A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A,
zhprfs - 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
zhpsv - compute the solution to a complex system of linear equations A * X = B,
zhpsvx - 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 - reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation
zhptrf - compute the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method
zhptri - 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 - 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 - use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H
zhseqr - 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 - 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 - conjugate a complex vector of length N
zlacon - estimate the 1-norm of a square, complex matrix A
zlacp2 - copie all or part of a real two-dimensional matrix A to a complex matrix B
zlacpy - copie all or part of a two-dimensional matrix A to another matrix B
zlacrm - perform a very simple matrix-matrix multiplication
zlacrt - perform the operation  ( c s )( x ) ==> ( x ) ( -s c )( y ) ( y )  where c and s are complex and the vectors x and y are complex
zladiv - := X / Y, where X and Y are complex
zlaed0 - 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 - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
zlaed8 - merge the two sets of eigenvalues together into a single sorted set
zlaein - use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H
zlaesy - 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 - compute the eigendecomposition of a 2-by-2 Hermitian matrix [ A B ] [ CONJG(B) C ]
zlags2 - compute 2-by-2 unitary matrices U, V and Q, such that if ( UPPER ) then  U'*A*Q = U'*( A1 A2 )*Q = ( x 0 ) ( 0 A3 ) ( x x ) and V'*B*Q = V'*( B1 B2 )*Q = ( x 0 ) ( 0 B3 ) ( x x )  or if ( .NOT.UPPER ) then  U'*A*Q = U'*( A1 0 )*Q = ( x x ) ( A2 A3 ) ( 0 x ) and V'*B*Q = V'*( B1 0 )*Q = ( x x ) ( B2 B3 ) ( 0 x ) where  U = ( CSU SNU ), V = ( CSV SNV ),
zlagtm - perform a matrix-vector product of the form  B := alpha * A * X + beta * B  where A is a tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta are real scalars, each of which may be 0., 1., or -1
zlahef - compute a partial factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zlahqr - i an auxiliary routine called by ZHSEQR to update the eigenvalues and Schur decomposition already computed by ZHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
zlahrd - reduce the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
zlaic1 - applie one step of incremental condition estimation in its simplest version
zlals0 - applie back the multiplying factors of either the left or the right singular vector matrix of a diagonal matrix appended by a row to the right hand side matrix B in solving the least squares problem using the divide-and-conquer SVD approach
zlalsa - i an itermediate step in solving the least squares problem by computing the SVD of the coefficient matrix in compact form (The singular vectors are computed as products of simple orthorgonal matrices.)
zlalsd - use the singular value decomposition of A to solve the least squares problem of finding X to minimize the Euclidean norm of each column of A*X-B, where A is N-by-N upper bidiagonal, and X and B are N-by-NRHS
zlangb - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals
zlange - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex matrix A
zlangt - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex tridiagonal matrix A
zlanhb - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n hermitian band matrix A, with k super-diagonals
zlanhe - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A
zlanhp - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A, supplied in packed form
zlanhs - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A
zlanht - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex Hermitian tridiagonal matrix A
zlansb - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals
zlansp - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A, supplied in packed form
zlansy - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A
zlantb - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals
zlantp - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form
zlantr - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A
zlapll - two column vectors X and Y, let  A = ( X Y )
zlapmt - rearrange the columns of the M by N matrix X as specified by the permutation ,K(2),...,K(N) of the integers 1,...,N
zlaqgb - equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C
zlaqge - equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C
zlaqhb - equilibrate a symmetric band matrix A using the scaling factors in the vector S
zlaqhe - equilibrate a Hermitian matrix A using the scaling factors in the vector S
zlaqhp - equilibrate a Hermitian matrix A using the scaling factors in the vector S
zlaqp2 - compute a QR factorization with column pivoting of the block A(OFFSET+1:M,1:N)
zlaqps - compute a step of QR factorization with column pivoting of a complex M-by-N matrix A by using Blas-3
zlaqsb - equilibrate a symmetric band matrix A using the scaling factors in the vector S
zlaqsp - equilibrate a symmetric matrix A using the scaling factors in the vector S
zlaqsy - equilibrate a symmetric matrix A using the scaling factors in the vector S
zlar1v - compute the (scaled) r-sigma I
zlar2v - applie a vector of complex plane rotations with real cosines from both sides to a sequence of 2-by-2 complex Hermitian matrices,
zlarcm - perform a very simple matrix-matrix multiplication
zlarf - applie a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right
zlarfb - applie a complex block reflector H or its transpose H' to a complex M-by-N matrix C, from either the left or the right
zlarfg - generate a complex elementary reflector H of order n, such that  H' * ( alpha ) = ( beta ), H' * H = I
zlarft - form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
zlarfx - applie a complex elementary reflector H to a complex m by n matrix C, from either the left or the right
zlargv - generate a vector of complex plane rotations with real cosines, determined by elements of the complex vectors x and y
zlarnv - return a vector of n random complex numbers from a uniform or normal distribution
zlarrv - compute the eigenvectors of the tridiagonal matrix T = L D L^T given L, D and the eigenvalues of L D L^T
zlartg - generate a plane rotation so that  [ CS SN ] [ F ] [ R ] [ __ ]
zlartv - applie a vector of complex plane rotations with real cosines to elements of the complex vectors x and y
zlarz - applie a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right
zlarzb - applie a complex block reflector H or its transpose H**H to a complex distributed M-by-N C from the left or the right
zlarzt - form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors
zlascl - multiplie the M by N complex matrix A by the real scalar CTO/CFROM
zlaset - initialize a 2-D array A to BETA on the diagonal and ALPHA on the offdiagonals
zlasr - perform the transformation  A := P*A, when SIDE = 'L' or 'l' ( Left-hand side )  A := A*P', when SIDE = 'R' or 'r' ( Right-hand side )  where A is an m by n complex matrix and P is an orthogonal matrix,
zlassq - return the values scl and ssq such that  ( scl**2 )*ssq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
zlaswp - perform a series of row interchanges on the matrix A
zlasyf - compute a partial factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
zlatbs - solve one of the triangular systems  A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
zlatdf - compute the contribution to the reciprocal Dif-estimate by solving for x in Z * x = b, where b is chosen such that the norm of x is as large as possible
zlatps - solve one of the triangular systems  A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
zlatrd - reduce NB rows and columns of a complex Hermitian matrix A to Hermitian tridiagonal form by a unitary similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A
zlatrs - solve one of the triangular systems  A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
zlatrz - factor the M-by-(M+L) complex upper trapezoidal matrix [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R 0 ) * Z by means of unitary transformations, where Z is an (M+L)-by-(M+L) unitary matrix and, R and A1 are M-by-M upper triangular matrices
zlatzm - routine is deprecated and has been replaced by routine ZUNMRZ
zlauu2 - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A
zlauum - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A
zlib - compression/decompression library
zlibc -
ZNumber -
Zoidberg - A modular perl shell
Zoidberg::Contractor - Module to manage jobs
Zoidberg::DispatchTable - Class to tie dispatch tables
Zoidberg::Fish - Base class for loadable Zoidberg plugins
Zoidberg::Fish::Commands - Zoidberg plugin with builtin commands
Zoidberg::Fish::Intel - Completion plugin for Zoidberg
Zoidberg::Fish::Log - History and log plugin for Zoidberg
Zoidberg::Fish::ReadLine - Readline glue for zoid
Zoidberg::PluginHash - Magic plugin loader
Zoidberg::Shell - A scripting interface to the Zoidberg shell
Zoidberg::StringParser - Simple string parser
Zoidberg::Utils - An interface to zoid's utility libs
Zoidberg::Utils::Error - OO error handling
Zoidberg::Utils::FileSystem - Filesystem routines
Zoidberg::Utils::GetOpt - Yet another GetOpt module
Zoidberg::Utils::Output - Zoidberg output routines
zope-zshell - zope-Add a command line interface to Zope
zpbcon - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite band matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPBTRF
zpbequ - 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)
zpbrfs - 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
zpbstf - compute a split Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbsv - compute the solution to a complex system of linear equations A * X = B,
zpbsvx - 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 - compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrf - compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrs - 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
zpocon - 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
zpoequ - 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)
zporfs - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
zposv - compute the solution to a complex system of linear equations A * X = B,
zposvx - 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 - compute the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotrf - compute the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotri - 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 - 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
zppcon - 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
zppequ - 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)
zpprfs - 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
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
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)
ztgex2 - swap adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22)
ztgexc - reorder the generalized Schur decomposition of a complex matrix pair (A,B), using an unitary equivalence transformation (A, B) := Q * (A, B) * Z', so that the diagonal block of (A, B) with row index IFST is moved to row ILST
ztgsen - reorder the generalized Schur decomposition of a complex matrix pair (A, B) (in terms of an unitary equivalence trans- formation Q' * (A, B) * Z), so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the pair (A,B)
ztgsja - compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B
ztgsna - estimate reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a matrix pair (A, B)
ztgsy2 - L * E = scale * F  using Level 1 and 2 BLAS, where R and L are unknown M-by-N matrices,
ztgsyl - solve the generalized Sylvester equation
ztpcon - estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
ztpmv - perform one of the matrix-vector operations   x := A*x, or x := A'*x, or x := conjg( A' )*x,
ztprfs - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
ztpsv - solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b,
ztptri - compute the inverse of a complex upper or lower triangular matrix A stored in packed format
ztptrs - solve a triangular system of the form  A * X = B, A**T * X = B, or A**H * X = B,
ztrcon - estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
ztrevc - compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T
ztrexc - reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row index IFST is moved to row ILST
ztrmm - perform one of the matrix-matrix operations   B := alpha*op( A )*B, or B := alpha*B*op( A )  where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of   op( A ) = A or op( A ) = A' or op( A ) = conjg( A' )
ztrmv - perform one of the matrix-vector operations   x := A*x, or x := A'*x, or x := conjg( A' )*x,
ztrrfs - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
ztrsen - reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in the leading positions on the diagonal of the upper triangular matrix T, and the leading columns of Q form an orthonormal basis of the corresponding right invariant subspace
ztrsm - solve one of the matrix equations   op( A )*X = alpha*B, or X*op( A ) = alpha*B,
ztrsna - estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper triangular matrix T (or of any matrix Q*T*Q**H with Q unitary)
ztrsv - solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b,
ztrsyl - solve the complex Sylvester matrix equation
ztrti2 - compute the inverse of a complex upper or lower triangular matrix
ztrtri - compute the inverse of a complex upper or lower triangular matrix A
ztrtrs - solve a triangular system of the form  A * X = B, A**T * X = B, or A**H * X = B,
ztzrqf - routine is deprecated and has been replaced by routine ZTZRZF
ztzrzf - reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations
zung2l - generate an m by n complex matrix Q with orthonormal columns,
zung2r - generate an m by n complex matrix Q with orthonormal columns,
zungbr - generate one of the complex unitary matrices Q or P**H determined by ZGEBRD when reducing a complex matrix A to bidiagonal form
zunghr - generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by ZGEHRD
zungl2 - generate an m-by-n complex matrix Q with orthonormal rows,
zunglq - generate an M-by-N complex matrix Q with orthonormal rows,
zungql - generate an M-by-N complex matrix Q with orthonormal columns,
zungqr - generate an M-by-N complex matrix Q with orthonormal columns,
zungr2 - generate an m by n complex matrix Q with orthonormal rows,
zungrq - generate an M-by-N complex matrix Q with orthonormal rows,
zungtr - generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by ZHETRD
zunm2l - overwrite the general complex m-by-n matrix C with  Q * C if SIDE = 'L' and TRANS = 'N', or  Q'* C if SIDE = 'L' and TRANS = 'C', or  C * Q if SIDE = 'R' and TRANS = 'N', or  C * Q' if SIDE = 'R' and TRANS = 'C',
zunm2r - overwrite the general complex m-by-n matrix C with  Q * C if SIDE = 'L' and TRANS = 'N', or  Q'* C if SIDE = 'L' and TRANS = 'C', or  C * Q if SIDE = 'R' and TRANS = 'N', or  C * Q' if SIDE = 'R' and TRANS = 'C',
zunmbr - VECT = 'Q', ZUNMBR overwrites the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmhr - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunml2 - overwrite the general complex m-by-n matrix C with  Q * C if SIDE = 'L' and TRANS = 'N', or  Q'* C if SIDE = 'L' and TRANS = 'C', or  C * Q if SIDE = 'R' and TRANS = 'N', or  C * Q' if SIDE = 'R' and TRANS = 'C',
zunmlq - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmql - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmqr - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmr2 - overwrite the general complex m-by-n matrix C with  Q * C if SIDE = 'L' and TRANS = 'N', or  Q'* C if SIDE = 'L' and TRANS = 'C', or  C * Q if SIDE = 'R' and TRANS = 'N', or  C * Q' if SIDE = 'R' and TRANS = 'C',
zunmr3 - overwrite the general complex m by n matrix C with  Q * C if SIDE = 'L' and TRANS = 'N', or  Q'* C if SIDE = 'L' and TRANS = 'C', or  C * Q if SIDE = 'R' and TRANS = 'N', or  C * Q' if SIDE = 'R' and TRANS = 'C',
zunmrq - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmrz - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmtr - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zupgtr - generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by ZHPTRD using packed storage
zupmtr - overwrite the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zzip_closedir - (../../zzip/dir.c)
zzip_compr_str - (../../zzip/info.c)
zzip_dir_alloc_ext_io - (../../zzip/zip.c)
zzip_dir_close - (../../zzip/zip.c)
zzip_dir_fdopen - (../../zzip/zip.c)
zzip_dir_free - (../../zzip/zip.c)
zzip_dirhandle - (../../zzip/info.c)
zzip_dir_open - (../../zzip/zip.c)
zzip_dir_read - (../../zzip/zip.c)
zzip_dir_stat - (../../zzip/stat.c)
zzip_errno - (../../zzip/err.c)
zzip_error - (../../zzip/info.c)
zzip_fclose - (../../zzip/file.c)
zzip_file_close - (../../zzip/file.c)
zzip_file_open - (../../zzip/file.c)
zzip_file_read - (../../zzip/file.c)
zzip_file_real - (../../zzip/info.c)
zzip_fopen - (../../zzip/file.c)
zzip_inflate_init - (../../zzip/file.c)
zzip_init_io - (../../zzip/plugin.c)
zziplib.h - library
zzip_open - (../../zzip/file.c)
zzip_opendir - (../../zzip/dir.c)
zzip_read - (../../zzip/file.c)
zzip_readdir - (../../zzip/dir.c)
zzip_rewind - (../../zzip/file.c)
zzip_rewinddir - (../../zzip/dir.c)
zzip_seek - (../../zzip/file.c)
zzip_strerror - (../../zzip/err.c)
zzip_tell - (../../zzip/file.c)