Home
Browse
Site Map
Advanced Search
Preferences

Help
Latest Docs
About CrayDoc
Support
Contact Us

 Results for  (1289 hits) Search Time: 0.0434 sec.  |  Build Time: 0.0127 sec.  

Result page: 1  2  3  4  5  ... 65  Next»    View All Pages

Results sorted by title
Resort results by: title, publication number, or release date

cbdsqr(3l)  -- compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B

cbdsqr(3l) CBDSQR(3l) ) CBDSQR(3l) NAME CBDSQR - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B SYNOPSIS SUBROUTINE CBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, ...


cgbbrd(3l)  -- reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation

cgbbrd(3l) CGBBRD(3l) ) CGBBRD(3l) NAME CGBBRD - reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation SYNOPSIS SUBROUTINE CGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, ...


cgbcon(3l)  -- estimate the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm,

cgbcon(3l) CGBCON(3l) ) CGBCON(3l) NAME CGBCON - estimate the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm, SYNOPSIS SUBROUTINE CGBCON( NORM, N, KL, KU, AB, ...


cgbequ(3l)  -- compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number

cgbequ(3l) CGBEQU(3l) ) CGBEQU(3l) NAME CGBEQU - compute row and column scalings intended to equi­ librate an M-by-N band matrix A and reduce its condition number SYNOPSIS SUBROUTINE CGBEQU( M, N, KL, KU, AB, LDAB, R, C, ...


cgbrfs(3l)  -- improve 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

cgbrfs(3l) CGBRFS(3l) ) CGBRFS(3l) NAME CGBRFS - improve the computed solution to a system of lin­ ear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution ...


cgbsv(3l)  -- compute 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

cgbsv(3l) CGBSV(3l) ) CGBSV(3l) NAME CGBSV - compute 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 ...


cgbsvx(3l)  -- use 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,

cgbsvx(3l) CGBSVX(3l) ) CGBSVX(3l) NAME CGBSVX - use 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, SYNOPSIS SUBROUTINE CGBSVX( FACT, TRANS, N, KL, ...


cgbtf2(3l)  -- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges

cgbtf2(3l) CGBTF2(3l) ) CGBTF2(3l) NAME CGBTF2 - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges SYNOPSIS SUBROUTINE CGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO ) ...


cgbtrf(3l)  -- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges

cgbtrf(3l) CGBTRF(3l) ) CGBTRF(3l) NAME CGBTRF - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges SYNOPSIS SUBROUTINE CGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO ) ...


cgbtrs(3l)  -- 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 the LU factorization computed by CGBTRF

cgbtrs(3l) CGBTRS(3l) ) CGBTRS(3l) NAME CGBTRS - 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 the LU factorization computed by CGBTRF SYNOPSIS SUBROUTINE ...


cgebak(3l)  -- form the right or left eigenvectors of a complex general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by CGEBAL

cgebak(3l) CGEBAK(3l) ) CGEBAK(3l) NAME CGEBAK - form the right or left eigenvectors of a complex general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by CGEBAL SYNOPSIS ...


cgebal(3l)  -- balance a general complex matrix A

cgebal(3l) CGEBAL(3l) ) CGEBAL(3l) NAME CGEBAL - balance a general complex matrix A SYNOPSIS SUBROUTINE CGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO ) CHARACTER JOB INTEGER IHI, ILO, INFO, LDA, N ...


cgebd2(3l)  -- reduce a complex general m by n matrix A to upper or lower real bidiagonal form B by a unitary transformation

cgebd2(3l) CGEBD2(3l) ) CGEBD2(3l) NAME CGEBD2 - reduce a complex general m by n matrix A to upper or lower real bidiagonal form B by a unitary transforma­ tion SYNOPSIS SUBROUTINE CGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, ...


cgebrd(3l)  -- reduce a general complex M-by-N matrix A to upper or lower bidiagonal form B by a unitary transformation

cgebrd(3l) CGEBRD(3l) ) CGEBRD(3l) NAME CGEBRD - reduce a general complex M-by-N matrix A to upper or lower bidiagonal form B by a unitary transformation SYNOPSIS SUBROUTINE CGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, ...


cgecon(3l)  -- estimate the reciprocal of the condition number of a general complex matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by CGETRF

cgecon(3l) CGECON(3l) ) CGECON(3l) NAME CGECON - estimate the reciprocal of the condition number of a general complex matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by CGETRF ...


cgeequ(3l)  -- compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number

cgeequ(3l) CGEEQU(3l) ) CGEEQU(3l) NAME CGEEQU - compute row and column scalings intended to equi­ librate an M-by-N matrix A and reduce its condition number SYNOPSIS SUBROUTINE CGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, ...


cgees(3l)  -- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z

cgees(3l) CGEES(3l) ) CGEES(3l) NAME CGEES - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z SYNOPSIS SUBROUTINE CGEES( JOBVS, SORT, ...


cgeesx(3l)  -- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z

cgeesx(3l) CGEESX(3l) ) CGEESX(3l) NAME CGEESX - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z SYNOPSIS SUBROUTINE CGEESX( JOBVS, SORT, ...


cgeev(3l)  -- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors

cgeev(3l) CGEEV(3l) ) CGEEV(3l) NAME CGEEV - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors SYNOPSIS SUBROUTINE CGEEV( JOBVL, JOBVR, N, A, LDA, W, ...


cgeevx(3l)  -- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors

cgeevx(3l) CGEEVX(3l) ) CGEEVX(3l) NAME CGEEVX - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors SYNOPSIS SUBROUTINE CGEEVX( BALANC, JOBVL, JOBVR, SENSE, ...


 Results for  (1289 hits) Search Time: 0.0434 sec.  |  Build Time: 0.0127 sec.  

Result page: 1  2  3  4  5  ... 65  Next»    View All Pages