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

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.

Function Documentation

std::ostream& sparseqr::operator<<	(	std::ostream &	os,
		const Packed &	p
	)

std::ostream& sparseqr::operator<<	(	std::ostream &	os,
		const Qmatrix &	q
	)

std::ostream& sparseqr::operator<<	(	std::ostream &	os,
		const J &	j
	)

Classes

Functions

Detailed Description

Function Documentation