Algorithm 782 : codes for rank-revealing QR factorizations of dense matrices.
Journal Article
·
· ACM Trans. Math. Software
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 originally suggested by Chandrasekaran and Ipsen and by Pan and Tang, respectively, We highlight usage and features of these codes.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- ER
- DOE Contract Number:
- DE-AC02-06CH11357
- OSTI ID:
- 937862
- Report Number(s):
- MCS-P560-0196; TRN: US200905%%677
- Journal Information:
- ACM Trans. Math. Software, Vol. 24, Issue 2 ; Jun. 1998
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
Computing rank-revealing QR factorizations of dense matrices.
Efficient algorithms for computing a strong rank-revealing QR factorization
Structure-preserving and rank-revealing QR-factorizations
Journal Article
·
Mon Jun 01 00:00:00 EDT 1998
· ACM Trans. Math. Software
·
OSTI ID:937862
Efficient algorithms for computing a strong rank-revealing QR factorization
Journal Article
·
Mon Jul 01 00:00:00 EDT 1996
· SIAM Journal on Scientific Computing
·
OSTI ID:937862
Structure-preserving and rank-revealing QR-factorizations
Journal Article
·
Fri Nov 01 00:00:00 EST 1991
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:937862