| Algorithm 782: codes for rank-revealing QR factorizations of dense matrices |
| Full text |
Pdf
(78 KB)
|
| Source
|
ACM Transactions on Mathematical Software (TOMS)
archive
Volume 24 , Issue 2 (June 1998)
table of contents
Pages: 254 - 257
Year of Publication: 1998
ISSN:0098-3500
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 84, Citation Count: 3
|
|
ABSTRACT
This article describes a suite of codes as well as associated testing and timing drivers for computing rank-revealing QR (RRQR) factorizations of dense matrices. The main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly used Golub pivoting strategy and improved versions of the RRQR algorithms for triangular matrices orginally suggersted by Chandrasekaran and Ipsen and by Pan and Tang, respectively, We highlight usage and features of these codes.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
E. Anderson , Z. Bai , C. Bischof , J. Demmel , J. Dongarra , J. Du Croz , A. Greenbaum , S. Hammarling , A. McKenney , S. Ostrouchov , D. Sorensen, LAPACK's user's guide, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992
|
 |
2
|
|
| |
3
|
|
| |
4
|
PAN, C.-T. AND TANG, P. T. P. 1992. Bounds on singular values revealed by QR factorization. Tech. Rep. MCS-P332-1092. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL.
|
REVIEW
"Charles Raymond Crawford : Reviewer"
A rank-revealing QR (RRQR) factorization is an efficient way to
compute a reasonable representation of the null space of a matrix. This
paper and the accompanying algorithm describe and analyze a suite of
codes that implement combi
more...
|