ACM Home Page
Please provide us with feedback. Feedback
Algorithm 782: codes for rank-revealing QR factorizations of dense matrices
Full text PdfPdf (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
C. H. Bischof  Argonne National Lab, Argonne, IL
G. Quintana-Ortí  Univ. Jaime I, Castellón, Spain
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 84,   Citation Count: 3
Additional Information:

appendices and supplements   abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/290200.287638
What is a DOI?

APPENDICES and SUPPLEMENTS
gZip782.gz (390 KB)
Software for "Computing Rank-Revealing QR Factorizations of Dense Matrices"


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.





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...

Collaborative Colleagues:
C. H. Bischof: colleagues
G. Quintana-Ortí: colleagues