·  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/clabrd(3) -- reduce the first NB rows and columns of a complex general m by n matrix A to upper or lower real bidiagonal fo CLABRD reduces the first NB rows and columns of a complex general m by n matrix A to upper or lower real bidiagonal form by a unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A. If m >= n, A is reduced to upper bidiagonal form; if m < n, to lower bidiagonal form. This is an auxiliary routine called by CGEBRD complib/clacgv(3) -- conjugate a complex vector of length N CLACGV conjugates a complex vector of length N.
complib/clacon(3) -- estimate the 1-norm of a square, complex matrix A
CLACON estimates the 1-norm of a square, complex matrix A. Reverse communication is used for evaluating matrix-vector products.
complib/clacpy(3) -- copie all or part of a two-dimensional matrix A to another matrix B
CLACPY copies all or part of a two-dimensional matrix A to another matrix B.
complib/clacrm(3) -- perform a very simple matrix-matrix multiplication
CLACRM performs a very simple matrix-matrix multiplication: C := A * B, where A is M by N and complex; B is N by N and real; C is M by N and complex.
complib/clacrt(3) -- applie a plane rotation, where the cos and sin (C and S) are complex and the vectors CX and CY are complex
CLACRT applies a plane rotation, where the cos and sin (C and S) are complex and the vectors CX and CY are complex.
old-compression/clAddAlgorithm(3d) -- Add a video or audio compression algorithm to the Compression Library
name A pointer to a string that contains the name of the algorithm. algType The type of the algorithm (CL_ALG_VIDEO or CL_ALG_AUDIO). maxHeaderSize The maximum size of the stream header for the specified algorithm. openCompressor A pointer to the function that opens a compressor for the new algorithm. The function must have the same arguments as clOpenCompressor. compress A pointer to the function that compresses for the new algorithm. The function must have the same arguments as clCompress. clo...
old-compression/clAddParam(3d) -- Add a video or audio compression parameter to the Compression Library
scheme The compression scheme that gets the added parameter. name A pointer to a string that contains the name of the parameter. paramType The type of the parameter (CL_ENUM_VALUE, CL_RANGE_VALUE, CL_FLOATING_ENUM_VALUE, or CL_FLOATING_RANGE_VALUE). min The minimum value the parameter can have. max The maximum value the parameter can have. initial The default value of the parameter. paramIDPtr A pointer to an int value that is to receive the new parameter identifier. paramID The parameter identi...
complib/cladiv(3) -- := X / Y, where X and Y are complex
CLADIV := X / Y, where X and Y are complex. The computation of X / Y will not overflow on an intermediary step unless the results overflows.
complib/claed0(3) -- the divide and conquer method, CLAED0 computes all eigenvalues of a symmetric tridiagonal matrix which is one
Using the divide and conquer method, CLAED0 computes all eigenvalues of a symmetric tridiagonal matrix which is one diagonal block of those from reducing a dense or band Hermitian matrix and corresponding eigenvectors of the dense or band matrix.
complib/claed7(3) -- modification by a rank-one symmetric matrix
CLAED7 computes the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix. This routine is used only for the eigenproblem which requires all eigenvalues and optionally eigenvectors of a dense or banded Hermitian matrix that has been reduced to tridiagonal form. T = Q(in) ( D(in) + RHO * Z*Z' ) Q'(in) = Q(out) * D(out) * Q'(out) where Z = Q'u, u is a vector of length N with ones in the CUTPNT and CUTPNT + 1 th elements and zeros elsewhere. The eigenvectors...
complib/claed8(3) -- merge the two sets of eigenvalues together into a single sorted set
CLAED8 merges the two sets of eigenvalues together into a single sorted set. Then it tries to deflate the size of the problem. There are two ways in which deflation can occur: when two or more eigenvalues are close together or if there is a tiny element in the Z vector. For each such occurrence the order of the related secular equation problem is reduced by one.
complib/claein(3) -- use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper
CLAEIN uses inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H.
complib/claesy(3) -- compute the eigendecomposition of a 2-by-2 symmetric matrix ( ( A, B );( B, C ) ) provided the norm of the mat
CLAESY computes the eigendecomposition of a 2-by-2 symmetric matrix ( ( A, B );( B, C ) ) provided the norm of the matrix of eigenvectors is larger than some threshold value. RT1 is the eigenvalue of larger absolute value, and RT2 of smaller absolute value. If the eigenvectors are computed, then on return ( CS1, SN1 ) is the unit eigenvector for RT1, hence [ CS1 SN1 ] . [ A B ] . [ CS1 -SN1 ] = [ RT1 0 ] [ -SN1 CS1 ] [ B C ] [ SN1 CS1 ] [ 0 RT2 ]...
complib/claev2(3) -- compute the eigendecomposition of a 2-by-2 Hermitian matrix [ A B ] [ CONJG(B) C ]
CLAEV2 computes the eigendecomposition of a 2-by-2 Hermitian matrix [ A B ] [ CONJG(B) C ]. On return, RT1 is the eigenvalue of larger absolute value, RT2 is the eigenvalue of smaller absolute value, and (CS1,SN1) is the unit right eigenvector for RT1, giving the decomposition [ CS1 CONJG(SN1) ] [ A B ] [ CS1 -CONJG(SN1) ] = [ RT1 0 ] [- SN1 CS1 ] [ CONJG(B) C ] [ SN1 CS1 ] [ 0 RT2 ].
<<  [Prev]  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  53  [Next]  >>