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

  man pages->IRIX man pages              
Title
Content
Arch
Section
 
 complib/chprfs(3) -- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefin
    CHPRFS improves 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.
 complib/CHPSL(3) -- CHISL solves the complex Hermitian system A * X = B using the factors computed by CHPFA.
    On Entry AP COMPLEX(N*(N+1)/2) the output from CHPFA. N INTEGER the order of the matrix A . KVPT INTEGER(N) the pivot vector from CHPFA. B COMPLEX(N) the right hand side vector. On Return B the solution vector X . Error Condition A division by zero may occur if CHPCO has set RCOND .EQ. 0.0 or CHPFA has set INFO .NE. 0 . To compute INVERSE(A) * C where C is a matrix with P columns CALL CHPFA(AP,N,KVPT,INFO) IF (INFO .NE. 0) GO TO ... DO 10 J = 1, P CALL CHPSL(AP,N,KVPT,C(1,J)) 10 CONTINUE LINPACK...
 complib/chpsv(3) -- X = B,
    CHPSV computes 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. The diagonal pivoting method is used to factor A as A = U * D * U**H, if UPLO = 'U', or A = L * D * L**H, if UPLO = 'L', where U (or L) is a product of permutation and unit upper (lower) triangular matrices, D is Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then used t...
 complib/chpsvx(3) -- and X and B are N-by-NRHS matrices
    CHPSVX uses 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. Error bounds on the solution and a condition estimate are also provided.
 complib/chptrd(3) -- reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary si
    CHPTRD reduces a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation: Q**H * A * Q = T.
 complib/chptrf(3) -- using the Bunch-Kaufman diagonal pivoting method
    CHPTRF computes the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method: A = U*D*U**H or A = L*D*L**H where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
 complib/chptri(3) -- compute the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U
    CHPTRI computes 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 CHPTRF.
 complib/chptrs(3) -- solve a system of linear equations A*X = B with a complex Hermitian matrix A stored in packed format using the
    CHPTRS solves 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 CHPTRF.
 complib/chsein(3) -- use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H
    CHSEIN uses inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H. The right eigenvector x and the left eigenvector y of the matrix H corresponding to an eigenvalue w are defined by: H * x = w * x, y**h * H = w * y**h where y**h denotes the conjugate transpose of the vector y.
 complib/chseqr(3) -- compute the eigenvalues of a complex upper Hessenberg matrix H, and, optionally, the matrices T and Z from the
    CHSEQR computes 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. Optionally Z may be postmultiplied into an input unitary matrix Q, so that this routine can give the Schur factorization of a matrix A which has been reduced to the Hessenberg form H by the unitary matrix Q: A = Q*H*Q**H = (QZ)*T*(QZ)**H....
 standard/chunksize(3) -- specifies minimum object size in memory
    chunk Expects the minimum memory size to allocate for an object. As you add objects to a display list, chunk is the unit size (in bytes) by which the memory allocated to the display list grows.
 complib/CINVIT(3) -- EISPACK routine. This subroutine finds those eigenvectors of A COMPLEX UPPER Hessenberg matrix corresponding t
    On INPUT NM must be set to the row dimension of two-dimensional array parameters as declared in the calling program dimension statement. N is the order of the matrix. AR and AI contain the real and imaginary parts, respectively, of the Hessenberg matrix. WR and WI contain the real and imaginary parts, respectively, of the eigenvalues of the matrix. The eigenvalues must be stored in a manner identical to that of subroutine COMLR, which recognizes possible splitting of the matrix. SELECT specifies...
 standard/circ(3) -- outlines a circle
    x expects the x coordinate of the center of the circle specified in world coordinates. y expects the y coordinate of the center of the circle specified in world coordinates. radius expects the length of the radius of the circle.
 standard/circf(3) -- draws a filled circle
    x expects the x coordinate of the center of the filled circle specified in world coordinates. y expects the y coordinate of the center of the filled circle specified in world coordinates. radius expects the length of the radius of the filled circle.
 ckpt_create(3) -- checkpoint and restart (CPR) library interfaces
    The functions provided here are used to issue checkpoint and restart (CPR) requests to a process or group of processes. The ckpt_setup, ckpt_create, ckpt_restart, and ckpt_remove routines are implemented according to the IEEE standard POSIX 1003.1m Draft 1, with minor modifications (described below). The ckpt_stat function is an IRIX extension. Silicon Graphics intends to follow the future development of POSIX 1003.1m draft standards and endeavor to be compliant. ckpt_setup This routine currentl...
<<  [Prev]  12  13  14  15  16  17  18  19  20  21  22  23  24  25  26  27  28  29  30  31  32  
33  34  35  36  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  [Next]  >>
Copyright © 2004-2005 DeniX Solutions SRL
newsletter delivery service