On the failure of rank-revealing QR factorization software - A case study

ACM Transactions on Mathematical Software

Volumn 35, Issue 2, 2008, Pages

  Drmač, Zlatko ^a   Bujanović, Zvonimir ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Pivoting; QR factorization; Rank revealing

Indexed keywords

COLUMNS (STRUCTURAL); COMPUTER SOFTWARE; NUMERICAL ANALYSIS; SOFTWARE PACKAGES;

CASE STUDIES; COMPUTATIONAL ROUTINES; COMPUTER EXPERIMENTS; FINITE-PRECISION ARITHMETICS; LINPACK; NUMERICAL RANK; PIVOTING; QR FACTORIZATION; QR FACTORIZATIONS; RANK-REVEALING; SOFTWARE IMPLEMENTATIONS; UPDATING STRATEGY;

FACTORIZATION;

EID: 48849110060     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1377612.1377616     Document Type: Article

References (18)

1. BISCHOF, C. H. AND QUINTANA-ORTI, G. 1998. Computing rank-revealing QR factorizations of dense matrices. ACM Trans. Math. Softw. 24, 2, 226-253.
2. BUSINGER, P. A. AND GOLUB, G. H. 1965. Linear least squares solutions by Householder transformations. Numerische Mathematik 7, 269-276.
3. CHANDRASEKARAN, S. AND IPSEN, I. C. F. 1994. On rank-revealing factorizations. SIAM J. Matrix Anal. Appl. 15, 2, 592-622.
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 Analysis, 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. DRMAČ, Z., OMLADIČ, M., AND VESELIĆ, K. 1994. On the perturbation of the Cholesky factorization. SIAM J. Matrix Anal. Appl. 15, 4, 1319-1332.
8. DRMAČ, Z. AND VESELIĆ, K. 2007a. New fast and accurate Jacobi SVD algorithm: I. SIAM J. Matrix Anal. Appl. LAPACK Working Note 169.
9. DRMAČ, Z. AND VESELIĆ, K. 2007b. New fast and accurate Jacobi SVD algorithm: II. J. Matrix Anal. Appl. LAPACK Working Note 170.
10. HIGHAM, N. J. 1996. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, PA.
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. QUINTANA-ORTI, G., SUN, X., AND BISCHOF, C. H. 1998. A BLAS 3 version of the QR factorization with column pivoting. SIAM J. Sci. Comput. 19, 5, 1486-1494.
14. STEWART, G. W. 1977. Perturbation bounds for the QR decomposition of a matrix. SIAMJ. Numer. Anal. 14, 3, 509-518.
15. STEWART, G. W. 1993. On the perturbation of LU, Cholesky, and QR factorizations. SIAM J. Matrix Anal. Appl. 14, 4, 1141-1145.
16. SUN, J.-G. 1991. Perturbation bounds for the Cholesky and QR factorizations. BIT 31, 341-352.
17. VESELIĆ, K. AND HARI, V. 1989. A note on a one-sided Jacobi algorithm. Numerische Mathematik 56, 627-633.
18. ZHA, H. 1997. Singular values of a classical matrix. Amer. Math. Month. 104, 172-173.