Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:50:14Z | |
| dc.date.available | 2004-05-31T22:50:14Z | |
| dc.date.created | 1998-02 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | In this note we propose two algorithms to compute truncated pivoted QR approximations 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) | en_US |
| dc.format.extent | 115192 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/941 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3875 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-98-12 | en_US |
| dc.title | Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix | en_US |
| dc.type | Technical Report | en_US |