*nix Documentation Project
·  Home
 +   man pages
·  Linux HOWTOs
·  FreeBSD Tips
·  *niX Forums

  man pages->IRIX man pages              
Title
Content
Arch
Section
 
 complib/CTRSL(3) -- CTRSL solves systems of the form T * X = B or CTRANS(T) * X = B where T is a triangular matrix of order N. Her
    On Entry T COMPLEX(LDT,N) T contains the matrix of the system. 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. B COMPLEX(N). B contains the right hand side of the system. JOB INTEGER JOB specifies what kind of system is to be solved. If JOB is 00 solve T*X = B, T lower triangular, 01 solve T*X = B, T upper triangu...
 complib/ctrsna(3) -- estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper t
    CTRSNA 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/ctrsyl(3) -- solve the complex Sylvester matrix equation
    CTRSYL 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/ctrti2(3) -- compute the inverse of a complex upper or lower triangular matrix
    CTRTI2 computes the inverse of a complex upper or lower triangular matrix. This is the Level 2 BLAS version of the algorithm.
 complib/ctrtri(3) -- compute the inverse of a complex upper or lower triangular matrix A
    CTRTRI computes the inverse of a complex upper or lower triangular matrix A. This is the Level 3 BLAS version of the algorithm.
 complib/ctrtrs(3) -- or A**H * X = B,
    CTRTRS 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.
 ctype(3c) -- character handling
    These macros classify character-coded integer values. Each is a predicate returning non-zero for true, zero for false. The behavior of these macros, except for isascii, is affected by the current locale [see setlocale(3C)]. To modify the behavior, change the LC_TYPE category in setlocale, that is, setlocale (LC_CTYPE, newlocale). In the C locale, or in a...
 complib/ctzrqf(3) -- reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary tra
    CTZRQF 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/cung2l(3) -- generate an m by n complex matrix Q with orthonormal columns,
    CUNG2L 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 CGEQLF.
 complib/cung2r(3) -- generate an m by n complex matrix Q with orthonormal columns,
    CUNG2R 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 CGEQRF.
 complib/cungbr(3) -- generate one of the complex unitary matrices Q or P**H determined by CGEBRD when reducing a complex matrix A t
    CUNGBR generates one of the complex unitary matrices Q or P**H determined by CGEBRD 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 CUNGBR returns the first n columns of Q, where m >= n >= k; if m < k, Q = H(1) H(2) . . . H(m-1) and CUNGBR returns Q as an M-by-M matri...
 complib/cunghr(3) -- product of IHI-ILO elementary reflectors of order N, as returned by CGEHRD
    CUNGHR generates a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by CGEHRD: Q = H(ilo) H(ilo+1) . . . H(ihi-1).
 complib/cungl2(3) -- generate an m-by-n complex matrix Q with orthonormal rows,
    CUNGL2 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 CGELQF.
 complib/cunglq(3) -- generate an M-by-N complex matrix Q with orthonormal rows,
    CUNGLQ 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 CGELQF.
 complib/cungql(3) -- generate an M-by-N complex matrix Q with orthonormal columns,
    CUNGQL 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 CGEQLF.
<<  [Prev]  33  34  35  36  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  53  
54  55  56  57  58  59  60  61  62  63  64  65  66  67  68  69  70  71  72  73  [Next]  >>
Copyright © 2004-2005 DeniX Solutions SRL
newsletter delivery service