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

  man pages->IRIX man pages              
Title
Content
Arch
Section
 
 standard/zbsize(3) -- specifies the number of bit planes desired to comprise the Z buffer
    planes is the number of bit planes requested to be configured as Z buffer planes. Only positive values are accepted. The default is machine dependent, usually 24 or 32.
 standard/zbuffer(3) -- enable or disable z-buffer operation in the current framebuffer
    bool is either TRUE or FALSE. TRUE enables z-buffer operation. FALSE disables z-buffer operation.
 standard/zclear(3) -- initializes the z-buffer of the current framebuffer
    none
 standard/zdraw(3) -- enables or disables drawing to the z-buffer
    b expects one of two possible values: TRUE enables drawing of colors into the z-buffer. FALSE disables drawing of colors into the z-buffer.
 complib/zdrscl(3) -- multiplie an n-element complex vector x by the real scalar 1/a
    ZDRSCL multiplies an n-element complex vector x by the real scalar 1/a. This is done without overflow or underflow as long as the final result x/a does not overflow or underflow.
 standard/zfunction(3) -- specifies the function used for z-buffer comparison by the current framebuffer
    func expects one of eight possible flags used when comparing z values. The available flags are: ZF_NEVER, the z-buffer function never passes. ZF_LESS, the z-buffer function passes if the incoming pixel z value is less than the z value stored in the z-buffer bitplanes. ZF_EQUAL, the z-buffer function passes if the incoming pixel z value is equal to the z value stored in the z-buffer bitplanes. ZF_LEQUAL, the z-buffer function passes if the incoming pixel z value is less than or equal to the z val...
 complib/zgbbrd(3) -- reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation
    ZGBBRD reduces a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation: Q' * A * P = B. The routine computes B, and optionally forms Q or P', or computes Q'*C for a given matrix C.
 complib/zgbcon(3) -- general band matrix A, in either the 1-norm or the infinity-norm,
    ZGBCON estimates the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by ZGBTRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / ( norm(A) * norm(inv(A)) ).
 complib/zgbequ(3) -- compute row and column scalings intended to equilibrate an Mby-N band matrix A and reduce its condition number
    ZGBEQU computes row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number. R returns the row scale factors and C the column scale factors, chosen to try to make the largest element in each row and column of the matrix B with elements B(i,j)=R(i)*A(i,j)*C(j) have absolute value 1. R(i) and C(j) are restricted to be between SMLNUM = smallest safe number and BIGNUM = largest safe number. Use of these scaling factors is not guaranteed to reduce the condi...
 complib/zgbrfs(3) -- improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provi
    ZGBRFS improves 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.
 complib/zgbsv(3) -- compute the solution to a complex system of linear equations A * X = B, where A is a band matrix of order N wi
    ZGBSV computes 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. The LU decomposition with partial pivoting and row interchanges is used to factor A as A = L * U, where L is a product of permutation and unit lower triangular matrices with KL subdiagonals, and U is upper triangular with KL+KU superdiagonals. The factored form of A is then used to solve the system of eq...
 complib/zgbsvx(3) -- system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
    ZGBSVX uses 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, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices. Error bounds on the solution and a condition estimate are also provided.
 complib/zgbtf2(3) -- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
    ZGBTF2 computes an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges. This is the unblocked version of the algorithm, calling Level 2 BLAS.
 complib/zgbtrf(3) -- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
    ZGBTRF computes an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges. This is the blocked version of the algorithm, calling Level 3 BLAS.
 complib/zgbtrs(3) -- 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
    ZGBTRS solves 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.
<<  [Prev]  371  372  373  374  375  376  377  378  379  380  381  382  383  384  385  386  387  388  389  390  391  
392  393  394  395  396  397  398  399  400  401  402  403  404  405  406  407  408  409  410  411  [Next]  >>
Copyright © 2004-2005 DeniX Solutions SRL
newsletter delivery service