|
|
|
ctermid(3s) -- generate file name for terminal
|
|
ctermid generates the path name of the controlling terminal for the current process, and stores it in a string. If s is a NULL pointer, the string is stored in an internal static area, the contents of which are overwritten at the next call to ctermid, and the address of which is returned. Otherwise, s is assumed to point to a character array of at least L_ctermid elements; the path name is placed in this array and the ... |
|
complib/ctgevc(3) -- compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular ma
|
|
CTGEVC computes some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B). The right generalized eigenvector x and the left generalized eigenvector y of (A,B) corresponding to a generalized eigenvalue w are defined by: (A - wB) * x = 0 and y**H * (A - wB) = 0 where y**H denotes the conjugate tranpose of y. If an eigenvalue w is determined by zero diagonal elements of both A and B, a unit vector is returned as the corresponding eigenvector.... |
|
|
complib/ctgsja(3) -- compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) m
|
|
CTGSJA computes the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B. On entry, it is assumed that matrices A and B have the following forms, which may be obtained by the preprocessing subroutine CGGSVP from a general M-by-N matrix A and P-by-N matrix B: N-K-L K L A = K ( 0 A12 A13 ) if M-K-L >= 0; L ( 0 0 A23 ) M-K-L ( 0 0 0 ) N-K-L K L A = K ( 0 A12 A13 ) if M-K-L < 0; M-K ( 0 0 A23 ) N-K-L K L B = L ( 0 0 B13 ) P-L ( 0 0 0 ) whe... |
|
ctime(3c) -- convert date and time to string
|
|
ctime, ctime_r, localtime, localtime_r, gmtime, and gmtime_r accept arguments of type time_t, pointed to by clock, representing the time in seconds since 00:00:00 UTC, January 1, 1970. ctime and ctime_r return a pointer to a 26-character string as shown below. Time zone and daylight savings corrections are ... |
|
complib/ctpcon(3) -- triangular matrix A, in either the 1-norm or the infinity-norm
|
|
CTPCON estimates the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm. The norm of A is computed and an estimate is obtained for norm(inv(A)), then the reciprocal of the condition number is computed as RCOND = 1 / ( norm(A) * norm(inv(A)) ). |
|
complib/ctprfs(3) -- provide error bounds and backward error estimates for the solution to a system of linear equations with a tria
|
|
CTPRFS provides error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix. The solution matrix X must be computed by CTPTRS or some other means before entering this routine. CTPRFS does not do iterative refinement because doing so cannot improve the backward error. |
|
complib/ctptri(3) -- compute the inverse of a complex upper or lower triangular matrix A stored in packed format
|
|
CTPTRI computes the inverse of a complex upper or lower triangular matrix A stored in packed format. |
|
complib/ctptrs(3) -- or A**H * X = B,
|
|
CTPTRS solves a triangular system of the form where A is a triangular matrix of order N stored in packed format, and B is an N-by-NRHS matrix. A check is made to verify that A is nonsingular. |
|
complib/CTRCO(3) -- CTRCO estimates the condition of a complex triangular matrix.
|
|
On Entry T COMPLEX(LDT,N) T contains the triangular matrix. The zero elements of the matrix are not referenced, and the corresponding elements of the array can be used to store other information. LDT INTEGER LDT is the leading dimension of the array T. N INTEGER N is the order of the system. JOB INTEGER = 0 T is lower triangular. = nonzero T is upper triangular. On Return RCOND REAL an estimate of the reciprocal condition of T . For the system T*X = B , relative perturbations in T and B of size ... |
|
complib/ctrcon(3) -- matrix A, in either the 1-norm or the infinity-norm
|
|
CTRCON estimates the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm. The norm of A is computed and an estimate is obtained for norm(inv(A)), then the reciprocal of the condition number is computed as RCOND = 1 / ( norm(A) * norm(inv(A)) ). |
|
complib/CTRDI(3) -- CTRDI computes the determinant and inverse of a complex triangular matrix.
|
|
On Entry T COMPLEX(LDT,N) T contains the triangular matrix. The zero elements of the matrix are not referenced, and the corresponding elements of the array can be used to store other information. LDT INTEGER LDT is the leading dimension of the array T. N INTEGER N is the order of the system. JOB INTEGER = 010 no det, inverse of lower triangular. = 011 no det, inverse of upper triangular. = 100 det, no inverse. = 110 det, inverse of lower triangular. = 111 det, inverse of upper triangular. On Ret... |
|
complib/ctrevc(3) -- compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T
|
|
CTREVC 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/ctrexc(3) -- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row i
|
|
CTREXC 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/ctrrfs(3) -- provide error bounds and backward error estimates for the solution to a system of linear equations with a tria
|
|
CTRRFS 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 CTRTRS or some other means before entering this routine. CTRRFS does not do iterative refinement because doing so cannot improve the backward error. |
|
complib/ctrsen(3) -- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues ap
|
|
CTRSEN 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.... |
