@article {17742,
	title = {Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix},
	volume = {UMIACS-TR-98-12},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {In this note we propose two algorithms to compute truncated pivoted QRapproximations to a sparse matrix.  One is based on the Gram--Schmidt
algorithm, and the other on Householder triangularization.  Both
algorithms leave the original matrix unchanged, and the only
additional storage requirements are arrays to contain the
factorization itself.  Thus, the algorithms are particularly suited to
determining low-rank approximations to a sparse matrix.
(Also cross-referenced as UMIACS-TR-98-12)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/941},
	author = {Stewart, G.W.}
}
