Efficient algorithms for computing a strong rank-revealing QR factorization

SIAM Journal on Scientific Computing

Volumn 17, Issue 4, 1996, Pages 848-869

  Gu, Ming ^a   Eisenstat, Stanley C ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Yale University   (United States)

Author keywords

Numerical rank; Orthogonal factorization; Rank revealing factorization

Indexed keywords

EID: 0003216822     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/0917055     Document Type: Article

References (44)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, 2nd ed., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
2. T. BEELEN AND P. VAN DOOREN, An improved algorithm for the computation of Kronecker's canonical form of a singular pencil. Linear Algebra Appl., 105 (1988), pp. 9-65.
3. C. H. BISCHOF, A block QR factorization algorithm using restricted pivoting, in Proceedings, Supercomputing '89, ACM Press, New York, 1989, pp. 248-256.
4. _, Incremental condition estimation, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 312-322.
5. C. H. BISCHOF AND P. C. HANSEN, Structure preserving and rank-revealing QR-factorizations, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 1332-1350.
6. _, A block algorithm for computing rank-revealing QR factorizations. Numerical Algorithms, 2 (1992), pp. 371-392.
7. C. H. BISCHOF AND G. M. SHROFF, On updating signal subspaces, IEEE Trans. Signal Processing, 40 (1992), pp. 96-105.
8. P. A. BUSINGER AND G. H. GOLUB, Linear least squares solutions by Householder transformations, Numer. Math., 7 (1965), pp. 269-276.
9. T. F. CHAN, On the existence and computation of LU-factorizations with small pivots, Math. Comp., 42 (1984), pp. 535-547.
10. _, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
11. T. F. CHAN AND P. C. HANSEN, Computing truncated singular value decomposition least squares solutions by rank revealing QR-factorizations, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 519-530.
12. _, Some applications of the rank revealing QR factorization, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 727-741.
13. S. CHANDRASEKARAN AND I. IPSEN, On rank-revealing QR factorisations, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 592-622.
14. _, Analysis of a QR algorithm for computing singular values, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 520-535.
15. J. DEMMEL, M. HEATH, AND H. VAN DER VORST, Parallel numerical linear algebra, in Acta Numerica, A. Iserles, ed., Vol. 2, Cambridge University Press, Cambridge, 1993, pp. 111-197.
16. D. K. FADDEEV, V. N. KUBLANOVSKAYA, AND V. N. FADDEEVA, Solution of linear algebraic systems with rectangular matrices, Proc. Steklov Inst. Math., 96 (1968), pp. 93-111.
17. _, Sur les systemes lineaires algebriques de matrices rectangulaires et malconditionees, in Programmation en Mathematiques Numeriques, Editions Centre Nat. Recherche Sci., Paris VII, 1968, pp. 161-170.
18. L. V. FOSTER, Rank and null space calculations using matrix decomposition without column interchanges, Linear Algebra Appl., 74 (1986), pp. 47-71.
19. P. E. GILL, G. H. GOLUB, W. MURRAY, AND M. A. SAUNDERS, Methods for modifying matrix factorizations, Math. Comp., 28 (1974), pp. 505-535.
20. G. H. GOLUB, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
21. _, Matrix decompositions and statistical computation, in Statistical Computation, R. C. Milton and J. A. Neider, eds., Academic Press, New York, 1969, pp. 365-397.
22. G. H. GOLUB, V. KLEMA, AND G. W. STEWART, Rank Degeneracy and Least Squares Problems, Tech. Report TR-456, Dept. of Computer Science, University of Maryland, College Park, MD, 1976.
23. G. H. GOLUB AND V. PEREYRA, The differentiation of pseudo-inverses, separable nonlinear least squares problems and other tales, in Generalized Inverses and Applications, M. Z. Nashed, ed., Academic Press, New York, 1976, pp. 303-324.
24. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
25. W. B. GRAGG AND G. W. STEWART, A stable variant of the secant method for solving nonlinear equations, SIAM J. Numer. Anal., 13 (1976), pp. 880-903.
26. M. Gu, Finding Well-Conditioned Similarities to Block-Diagonalize Nonsymmetric Matrices is NP-Hard, J. of Complexity, 11 (1995), pp. 377-391.
27. W. W. HAGER, Condition estimates, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 311-316.
28. Y. P. HONG AND C.-T. PAN, Rank-revealing QR factorizations and the singular value decomposition, Math. Comp., 58 (1992), pp. 213-232.
29. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1991.
30. T.-M. HWANG, W.-W. LIN, AND D. PIERCE, An Alternative Column Selection Criterion for a Rank-Revealing QR Factorization, Tech. Report BCSTECH-93-021, Boeing Computer Services, Seattle, WA, July 1993. To appear in Math. Comp..
31. _, Improved Bound for Rank Revealing LU Factorizations, Tech. Report BCSTECH-93-007, Boeing Computer Services, Seattle, WA, Oct. 1993.
32. T.-M. HWANG, W.-W. LIN, AND E. K. YANG, Rank revealing LU factorizations, Linear Algebra Appl., 175 (1992), pp. 115-141.
33. W. KAHAN, Numerical linear algebra, Canad. Math. Bull., 9 (1966), pp. 757-801.
34. V. E. KANE, R. C. WARD, AND G. J. DAVIS, Assessment of linear dependencies in multivariate data, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 1022-1032.
35. V. N. KUBLANOVSKAYA, AB-Algorithm and its modifications for the spectral problems of linear pencils of matrices, Numer. Math., 43 (1984), pp. 329-342.
36. C. L. LAWSON AND R. J. HANSON, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
37. C.-T. PAN AND P. T. P. TANG, Bounds on Singular Values Revealed by QR Factorizations, Preprint MCS-P332-1092, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, Oct. 1992.
38. G. W. STEWART, Introduction to Matrix Computations, Academic Press, New York, 1973.
39. _, Rank degeneracy, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 403-413.
40. G. W. STEWART, Incremental Condition Calculation and Column Selection, Tech. Report CS TR-2495, Dept. of Computer Science, University of Maryland, College Park, MD, July 1990.
41. _, An updating algorithm for subspace tracking, IEEE Trans. Signal Processing, 40 (1992), pp. 1535-1541.
42. _, Updating a rank-revealing ULV decomposition, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 494-499.
43. J. H. WILKINSON, Error analysis of direct methods of matrix inversion, J. Assoc. Comput. Mach., 8 (1961), pp. 281-330.
44. S. WOLD, A. RUHE, H. WOLD, AND W. J. DUNN, III, The collinearity problem in linear regression. The partial least squares (PLS) approach to generalized inverses, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 735-743.