·  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/dgegv(3) -- the generalized eigenvalues (alphar +/- alphai*i, beta), and optionally, the left and/or right generalized eig DGEGV computes for a pair of n-by-n real nonsymmetric matrices A and B, the generalized eigenvalues (alphar +/- alphai*i, beta), and optionally, the left and/or right generalized eigenvectors (VL and VR). A generalized eigenvalue for a pair of matrices (A,B) is, roughly speaking, a scalar w or a ratio alpha/beta = w, such that A - w*B is singular. It is usually represented as the pair (alpha,beta), as there is a reasonable interpretation for beta=0, and even for both being zero. A good beginning... complib/dgehd2(3) -- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation DGEHD2 reduces a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation: Q' * A * Q = H .
complib/dgehrd(3) -- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
DGEHRD reduces a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation: Q' * A * Q = H .
complib/dgelq2(3) -- compute an LQ factorization of a real m by n matrix A
DGELQ2 computes an LQ factorization of a real m by n matrix A: A = L * Q.
complib/dgelqf(3) -- compute an LQ factorization of a real M-by-N matrix A
DGELQF computes an LQ factorization of a real M-by-N matrix A: A = L * Q.
complib/dgels(3) -- involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A
DGELS solves overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A. It is assumed that A has full rank. The following options are provided: 1. If TRANS = 'N' and m >= n: find the least squares solution of an overdetermined system, i.e., solve the least squares problem minimize || B - A*X ||. 2. If TRANS = 'N' and m < n: find the minimum norm solution of an underdetermined system A * X = B. 3. If TRANS = 'T'...
complib/dgelss(3) -- compute the minimum norm solution to a real linear least squares problem
DGELSS computes the minimum norm solution to a real linear least squares problem: Minimize 2-norm(| b - A*x |). using the singular value decomposition (SVD) of A. A is an M-by-N matrix which may be rank-deficient. Several right hand side vectors b and solution vectors x can be handled in a single call; they are stored as the columns of the M-by-NRHS right hand side matrix B and the N-by-NRHS solution matrix X. The effective rank of A is determined by treating as zero those singular values which ...
complib/dgelsx(3) -- compute the minimum-norm solution to a real linear least squares problem
DGELSX computes the minimum-norm solution to a real linear least squares problem: minimize || A * X - B || using a complete orthogonal factorization of A. A is an M-by-N matrix which may be rank-deficient. Several right hand side vectors b and solution vectors x can be handled in a single call; they are stored as the columns of the M-by-NRHS right hand side matrix B and the N-by-NRHS solution matrix X. The routine first computes a QR factorization with column pivoting: A * P = Q * [ R11 R12 ] [ ...
complib/dgeql2(3) -- compute a QL factorization of a real m by n matrix A
DGEQL2 computes a QL factorization of a real m by n matrix A: A = Q * L.
complib/dgeqlf(3) -- compute a QL factorization of a real M-by-N matrix A
DGEQLF computes a QL factorization of a real M-by-N matrix A: A = Q * L.
complib/dgeqpf(3) -- compute a QR factorization with column pivoting of a real M-by-N matrix A
DGEQPF computes a QR factorization with column pivoting of a real M-by-N matrix A: A*P = Q*R.
complib/dgeqr2(3) -- compute a QR factorization of a real m by n matrix A
DGEQR2 computes a QR factorization of a real m by n matrix A: A = Q * R.
complib/dgeqrf(3) -- compute a QR factorization of a real M-by-N matrix A
DGEQRF computes a QR factorization of a real M-by-N matrix A: A = Q * R.
complib/dgerfs(3) -- improve the computed solution to a system of linear equations and provides error bounds and backward error est
DGERFS improves the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution.
complib/dgerq2(3) -- compute an RQ factorization of a real m by n matrix A
DGERQ2 computes an RQ factorization of a real m by n matrix A: A = R * Q.
<<  [Prev]  43  44  45  46  47  48  49  50  51  52  53  54  55  56  57  58  59  60  61  62  63
64  65  66  67  68  69  70  71  72  73  74  75  76  77  78  79  80  81  82  83  [Next]  >>
Copyright © 2004-2005 DeniX Solutions SRL
newsletter delivery service