Class documentation of Concepts

Loading...
Searching...
No Matches
sparseqr Namespace Reference

Classes

class  Driver
 
class  Fill
 
class  GivensRotations
 
class  J
 
class  MinDegree
 
class  Packed
 
class  Qmatrix
 
class  QR
 
class  Smatrix
 

Functions

std::ostream & operator<< (std::ostream &os, const Packed &p)
 
std::ostream & operator<< (std::ostream &os, const J &j)
 
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

\[ P_r \cdot Q^\top \cdot A \cdot P_c^\top =
    \begin{pmatrix} R \\ 0 \end{pmatrix} \]

where $Q^\top \cdot Q = I \in R^{m\times m}$, $R \in R^{m\times m}$ is an upper triangular mxm matrix and $P_r\in R^{m\times m}$ as well as $P_c\in R^{n\times n}$ are permutation matrices.

Author
Thomas H. Robey, 1996, 1997, 1998
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.