·  Home
+   man pages
 -> Linux -> FreeBSD -> OpenBSD -> NetBSD -> Tru64 Unix -> HP-UX 11i -> IRIX
·  Linux HOWTOs
·  FreeBSD Tips
·  *niX Forums

man pages->IRIX man pages
 Title
 Content
 Arch
 Section All Sections 1 - General Commands 2 - System Calls 3 - Subroutines 4 - Special Files 5 - File Formats 6 - Games 7 - Macros and Conventions 8 - Maintenance Commands 9 - Kernel Interface n - New Commands
 complib/ztrevc(3) -- compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T ZTREVC computes some or all of the right and/or left eigenvectors of a complex upper triangular matrix T. The right eigenvector x and the left eigenvector y of T corresponding to an eigenvalue w are defined by: T*x = w*x, y'*T = w*y' where y' denotes the conjugate transpose of the vector y. If all eigenvectors are requested, the routine may either return the matrices X and/or Y of right or left eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an input unitary matrix. If T was obt... complib/ztrexc(3) -- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row i ZTREXC reorders 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. The Schur form T is reordered by a unitary similarity transformation Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by postmultplying it with Z.
complib/ztrrfs(3) -- provide error bounds and backward error estimates for the solution to a system of linear equations with a tria
ZTRRFS provides error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix. The solution matrix X must be computed by ZTRTRS or some other means before entering this routine. ZTRRFS does not do iterative refinement because doing so cannot improve the backward error.
complib/ztrsen(3) -- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues ap
ZTRSEN reorders 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. Optionally the routine computes the reciprocal condition numbers of the cluster of eigenvalues and/or the invariant subspace....
complib/ztrsna(3) -- estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper t
ZTRSNA estimates 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).
complib/ztrsyl(3) -- solve the complex Sylvester matrix equation
ZTRSYL solves the complex Sylvester matrix equation: op(A)*X + X*op(B) = scale*C or op(A)*X - X*op(B) = scale*C, where op(A) = A or A**H, and A and B are both upper triangular. A is Mby-M and B is N-by-N; the right hand side C and the solution X are M-byN; and scale is an output scale factor, set <= 1 to avoid overflow in X.
complib/ztrti2(3) -- compute the inverse of a complex upper or lower triangular matrix
ZTRTI2 computes the inverse of a complex upper or lower triangular matrix. This is the Level 2 BLAS version of the algorithm.
complib/ztrtri(3) -- compute the inverse of a complex upper or lower triangular matrix A
ZTRTRI computes the inverse of a complex upper or lower triangular matrix A. This is the Level 3 BLAS version of the algorithm.
complib/ztrtrs(3) -- or A**H * X = B,
ZTRTRS solves a triangular system of the form where A is a triangular matrix of order N, and B is an N-by-NRHS matrix. A check is made to verify that A is nonsingular.
complib/ztzrqf(3) -- reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary tra
ZTZRQF reduces the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations. The upper trapezoidal matrix A is factored as A = ( R 0 ) * Z, where Z is an N-by-N unitary matrix and R is an M-by-M upper triangular matrix.
complib/zung2l(3) -- generate an m by n complex matrix Q with orthonormal columns,
ZUNG2L generates an m by n complex matrix Q with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order m Q = H(k) . . . H(2) H(1) as returned by ZGEQLF.
complib/zung2r(3) -- generate an m by n complex matrix Q with orthonormal columns,
ZUNG2R generates an m by n complex matrix Q with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of order m Q = H(1) H(2) . . . H(k) as returned by ZGEQRF.
complib/zungbr(3) -- generate one of the complex unitary matrices Q or P**H determined by ZGEBRD when reducing a complex matrix A t
ZUNGBR generates one of the complex unitary matrices Q or P**H determined by ZGEBRD when reducing a complex matrix A to bidiagonal form: A = Q * B * P**H. Q and P**H are defined as products of elementary reflectors H(i) or G(i) respectively. If VECT = 'Q', A is assumed to have been an M-by-K matrix, and Q is of order M: if m >= k, Q = H(1) H(2) . . . H(k) and ZUNGBR returns the first n columns of Q, where m >= n >= k; if m < k, Q = H(1) H(2) . . . H(m-1) and ZUNGBR returns Q as an M-by-M matri...
complib/zunghr(3) -- product of IHI-ILO elementary reflectors of order N, as returned by ZGEHRD
ZUNGHR generates a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by ZGEHRD: Q = H(ilo) H(ilo+1) . . . H(ihi-1).
complib/zungl2(3) -- generate an m-by-n complex matrix Q with orthonormal rows,
ZUNGL2 generates an m-by-n complex matrix Q with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order n Q = H(k)' . . . H(2)' H(1)' as returned by ZGELQF.
<<  [Prev]  278  279  280  281  282  283  284  285  286  287  288  289  290  291  292  293  294  295  296  297  298
299  300  [Next]  >>