ACM Home Page
Please provide us with feedback. Feedback
On the Failure of Rank-Revealing QR Factorization Software -- A Case Study
Full text PdfPdf (1.79 MB)
Source
ACM Transactions on Mathematical Software (TOMS) archive
Volume 35 ,  Issue 2  (July 2008) table of contents
Article No. 12  
Year of Publication: 2008
ISSN:0098-3500
Authors
Zlatko Drmač  University of Zagreb
Zvonimir Bujanović  University of Zagreb
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 83,   Citation Count: 0
Additional Information:

abstract   references   index terms   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/1377612.1377616
What is a DOI?

ABSTRACT

This article reports an unexpected and rather erratic behavior of the LAPACK software implementation of the QR factorization with Businger-Golub column pivoting. It is shown that, due to finite precision arithmetic, the software implementation of the factorization can catastrophically fail to produce a properly structured triangular factor, thus leading to a potentially severe underestimate of a matrix's numerical rank. The 30-year old problem, dating back to LINPACK, has (undetectedly) badly affected many computational routines and software packages, as well as the study of rank-revealing QR factorizations. We combine computer experiments and numerical analysis to isolate, analyze, and fix the problem. Our modification of the current LAPACK xGEQP3 routine is already included in the LAPACK 3.1.0 release. The modified routine is numerically more robust and with a negligible overhead. We also provide a new, equally efficient, and provably numerically safe partial-column norm-updating strategy.


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
 
2
Businger, P. A. and Golub, G. H. 1965. Linear least squares solutions by Householder transformations. Numerische Mathematik 7, 269--276.
 
3
 
4
Cox, A. J. and Higham, N. J. 1998. Stability of Householder QR factorization for weighted least squares problems. In Proceedings of the 17th Dundee Biennial Conference Numerical Analy sis, D. F. Griffiths et al., eds. Pitman Research Notes in Mathematics, vol. 380. Addison Wesley Longman, Harlow, Essex, UK, 57--73.
 
5
Drmač, Z. 1994. Computing the singular and the generalized singular values. Ph.D. thesis, Lehrgebiet Mathematische Physik, Fernuniversität Hagen.
 
6
Drmač, Z. 1999. A posteriori computation of the singular vectors in a preconditioned Jacobi SVD algorithm. IMA J. Numer. Anal. 19, 191--213.
 
7
 
8
 
9
 
10
 
11
Kahan, W. 1966. Numerical linear algebra. Canadian Math. Bull. 9, 6, 757--801.
 
12
Powell, M. J. D. and Reid, J. K. 1969. On applying Householder transformations to linear least squares problems. In Proceedings of the Information Processing 68, Proc. International Federation of Information Processing Congress Conference on Information Proceesing, Edinburgh, UK. North Holland, Amsterdam, 122--126.
 
13
 
14
Stewart, G. W. 1977. Perturbation bounds for the QR decomposition of a matrix. SIAM J. Numer. Anal. 14, 3, 509--518.
 
15
 
16
 
17
 
18
Zha, H. 1997. Singular values of a classical matrix. Amer. Math. Month. 104, 172--173.

Collaborative Colleagues:
Zlatko Drmač: colleagues
Zvonimir Bujanović: colleagues