On the Failure of Rank-Revealing QR Factorization Software -- A Case Study

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.

[1]  T. Chan.  Rank Revealing OR Factorizations * , 2001 .

[2]  Z. Drmač,et al.  On the Perturbation of the Cholesky Factorization , 1994 .

[3]  Christian H. Bischof,et al.  Computing rank-revealing QR factorizations of dense matrices , 1998, TOMS.

[4]  Ji-guang Sun.  Perturbation bounds for the Cholesky andQR factorizations , 1991 .

[5]  John K. Reid,et al.  On applying Householder transformations to linear least squares problems , 1968, IFIP Congress.

[6]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[7]  Ilse C. F. Ipsen,et al.  On Rank-Revealing Factorisations , 1994, SIAM J. Matrix Anal. Appl..

[8]  Nicholas J. Higham,et al.  QR factorization with complete pivoting and accurate computation of the SVD , 2000 .

[9]  G. Stewart.  Perturbation Bounds for the $QR$ Factorization of a Matrix , 1977 .

[10]  Christian H. Bischof,et al.  A BLAS-3 Version of the QR Factorization with Column Pivoting , 1998, SIAM J. Sci. Comput..

[11]  V. Hari,et al.  A note on a one-sided Jacobi algorithm , 1989 .

[12]  Zlatko Drmac,et al.  New Fast and Accurate Jacobi SVD Algorithm. I , 2007, SIAM J. Matrix Anal. Appl..

[13]  G. W. Stewarty.  On the Perturbation of LU, Cholesky, and QR Factorizations , 2007 .

[14]  Nicholas J. Higham,et al.  Stability of Householder QR Factorization for Weighted Least Squares Problems , 2010 .

[15]  Z. Drmač.  A posteriori computation of the singular vectors in a preconditioned Jacobi SVD algorithm , 1999 .

[16]  G. Golub,et al.  Linear least squares solutions by householder transformations , 1965 .

[17]  G. Stewart.  On the perturbation of LU, Cholesky, and QR factorizations , 1993 .

[18]  Zlatko Drmac,et al.  New Fast and Accurate Jacobi SVD Algorithm. II , 2007, SIAM J. Matrix Anal. Appl..