SparseQR solver. More...
Classes | |
class | Driver |
Driver class for sparse QR decomposition. More... | |
class | Fill |
class | GivensRotations |
Given's Rotations. More... | |
class | J |
Given's rotations. More... | |
class | MinDegree |
class | Packed |
Row of a sparse matrix. More... | |
class | Qmatrix |
Q matrix of the QR factorization. More... | |
class | QR |
QR factorization. More... | |
class | Smatrix |
Functions | |
std::ostream & | operator<< (std::ostream &os, const J &j) |
std::ostream & | operator<< (std::ostream &os, const Packed &p) |
std::ostream & | operator<< (std::ostream &os, const Qmatrix &q) |
Detailed Description
SparseQR solver.
From the README file:
This routine computes the QR decomposition of a mxn matrix A, m>=n, such that
where , is an upper triangular mxm matrix and as well as are permutation matrices.
- See also
- Homepage of SparseQR
Thomas H. Robey and Deborah L. Sulsky, Row Ordering for Sparse QR Decomposition, SIAM J. Matrix Anal. and Appl., Vol. 15, No. 4, pp. 1208-1225, October 1994.
Function Documentation
◆ operator<<() [1/3]
std::ostream& sparseqr::operator<< | ( | std::ostream & | os, |
const J & | j | ||
) |
◆ operator<<() [2/3]
std::ostream& sparseqr::operator<< | ( | std::ostream & | os, |
const Packed & | p | ||
) |
◆ operator<<() [3/3]
std::ostream& sparseqr::operator<< | ( | std::ostream & | os, |
const Qmatrix & | q | ||
) |