- cimag
-
Obtenir la partie imaginaire d'un nombre complexe.
- cimag
-
complex imaginary functions
- cimagf
-
See cimag.3posix
- cimagl
-
See cimag.3posix
- circle
-
Draws a circle. Allegro game programming library.
- circlefill
-
Draws a filled circle. Allegro game programming library.
- CIRCLEQ_ENTRY
-
See queue.3
- CIRCLEQ_HEAD
-
See queue.3
- CIRCLEQ_INIT
-
See queue.3
- CIRCLEQ_INSERT_AFTER
-
See queue.3
- CIRCLEQ_INSERT_BEFORE
-
See queue.3
- CIRCLEQ_INSERT_HEAD
-
See queue.3
- CIRCLEQ_INSERT_TAIL
-
See queue.3
- CIRCLEQ_REMOVE
-
See queue.3
- cksum
-
calculate a cksum(1) compatible checksum
- clabrd
-
reduce 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
- clacgv
-
conjugate a complex vector of length N
- clacon
-
estimate the 1-norm of a square, complex matrix A
- clacp2
-
copie all or part of a real two-dimensional matrix A to a complex matrix B
- clacpy
-
copie all or part of a two-dimensional matrix A to another matrix B
- clacrm
-
perform a very simple matrix-matrix multiplication
- clacrt
-
perform the operation ( c s )( x ) ==> ( x ) ( -s c )( y ) ( y ) where c and s are complex and the vectors x and y are complex
- cladiv
-
:= X / Y, where X and Y are complex
- claed0
-
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
- claed7
-
compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
- claed8
-
merge the two sets of eigenvalues together into a single sorted set
- claein
-
use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H
- claesy
-
compute 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
- claev2
-
compute the eigendecomposition of a 2-by-2 Hermitian matrix [ A B ] [ CONJG(B) C ]
- clags2
-
compute 2-by-2 unitary matrices U, V and Q, such that if ( UPPER ) then U'*A*Q = U'*( A1 A2 )*Q = ( x 0 ) ( 0 A3 ) ( x x ) and V'*B*Q = V'*( B1 B2 )*Q = ( x 0 ) ( 0 B3 ) ( x x ) or if ( .NOT.UPPER ) then U'*A*Q = U'*( A1 0 )*Q = ( x x ) ( A2 A3 ) ( 0 x ) and V'*B*Q = V'*( B1 0 )*Q = ( x x ) ( B2 B3 ) ( 0 x ) where U = ( CSU SNU ), V = ( CSV SNV ),
- clagtm
-
perform a matrix-vector product of the form B := alpha * A * X + beta * B where A is a tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta are real scalars, each of which may be 0., 1., or -1
- clahef
-
compute a partial factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
- clahqr
-
i an auxiliary routine called by CHSEQR to update the eigenvalues and Schur decomposition already computed by CHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
- clahrd
-
reduce the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
- claic1
-
applie one step of incremental condition estimation in its simplest version
- clals0
-
applie back the multiplying factors of either the left or the right singular vector matrix of a diagonal matrix appended by a row to the right hand side matrix B in solving the least squares problem using the divide-and-conquer SVD approach
- clalsa
-
i an itermediate step in solving the least squares problem by computing the SVD of the coefficient matrix in compact form (The singular vectors are computed as products of simple orthorgonal matrices.)
- clalsd
-
use the singular value decomposition of A to solve the least squares problem of finding X to minimize the Euclidean norm of each column of A*X-B, where A is N-by-N upper bidiagonal, and X and B are N-by-NRHS
- clangb
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals
- clange
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex matrix A
- clangt
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex tridiagonal matrix A
- clanhb
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n hermitian band matrix A, with k super-diagonals
- clanhe
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A
- clanhp
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A, supplied in packed form
- clanhs
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A
- clanht
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex Hermitian tridiagonal matrix A
- clansb
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals
- clansp
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A, supplied in packed form
- clansy
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A
- clantb
-
return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals