Using perturbed qr factorizations to solve linear least-squares problems

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 2, 2009, Pages 674-693

  Avron, Haim ^a   Ng, Esmond ^b   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Iterative linear least squares solvers; Preconditioning sparse qr

Indexed keywords

GENERALIZED SPECTRUM; LEAST SQUARE; LINEAR LEAST SQUARES; MATRIX; NEW TOOLS; PRECONDITIONERS; QR FACTORIZATIONS; R FACTOR; SPECTRAL THEORY; WHAT-IF SCENARIOS;

FACTORIZATION;

EID: 72449138061     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/070698725     Document Type: Article

References (31)

1. H. AvRON, E. Ng, AND S. TOLEDO, A Generalized Courant-Fischer Minimax Theorem,Tech. report, Tel-Aviv University, Tel-Aviv, Israel, 2008.
2. J. L. BARLOW AND U. B. VEMULAPATI, Rank detection methods for sparse matrices,SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1279-1297.
3. C. Bischof and P. Tang, LAPACK Working Note 33: Robust Incremental Condition Estimation, Tech. report, University of Tennessee, Knoxville, TN, 1991.
4. C. H. Bischof, 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. C. H. Bischof, J. G. Lewis, AND D. J. Pierce, Incremental condition estimation for sparse matrices, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 644-659.
7. A°. BJÖRCK, A general updating algorithm for constrained linear least squares problems,SIAM J. Sci. Statist. Comput., 5 (1984), pp. 394-402.
8. A° bjoÖrck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
9. I. BRAINMAN AND S. TOLEDO, Nested-dissection orderings for sparse L U with partial pivoting,'m Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, VA, 2001, CD-ROM, SIAM, Philadelphia, 2001.
10. T. F. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
11. T. F. CHAN AND P. C. HANSEN, Some applications of the rank revealing QR factorization, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 727-741.
12. S. CHANDRASEKARAN AND I. C. F. IPSEN, On rank-revealing factorisations,SIAMJ. Matrix Anal. Appl., 15 (1994), pp. 592-622.
13. P. CONCUS, G. H. GOLUB, AND D. P. O'LEARY, A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, eds., Academic Press, New York, 1976, pp. 309-332.
14. T. A. DAVIS, Direct Methods for Sparse Linear Systems, Fundamentals of Algorithms 2, SIAM, Philadelphia, 2006.
15. T. A. Davis, J. R. Gilbert, S. I. Larimore, and E. G. Ng, A Column Approximate Minimum Degree Ordering Algorithm, Tech. report TR-00-005, Department of Computer and Information Science and Engineering, University of F lorida, Gainesville, FL, 2000.
16. I. S. Duff AND C. VÖMEL, Incremental norm estimation for dense and sparse matrices,BIT, 42 (2002), pp. 300-322.
17. L. V. FOSTER, The probability of large diagonal elements in the QR factorization,SIAM J. Sci. Statist. Comput., 11 (1990), pp. 531-544.
18. A. GEORGE AND M. T. HEATH, Solution of sparse linear least squares problems using Givens rotations, Linear Algebra Appl., 34 (1980), pp. 69-83.
19. P. E. Gill, W. Murray, M. A. Saunders, J. A. Tom lin, and M. H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Math. Programming, 36 (1986), pp. 183-209.
20. G. H. GOLUB, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
21. G. H. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal., 2 (1965), pp. 205-224.
22. G. H. GOLUB AND C. F. VAN Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
23. M. T. HEATH, Some extensions of an algorithm for sparse linear least squares problems,SIAM J. Sci. Statist. Comput., 3 (1982), pp. 223-237.
24. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Research Nat. Bur. Standards, 49 (1952), pp. 409-436.
25. N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
26. S.-M. Lu and J. L. Barlow, Multifrontal computation with the orthogonal factors of sparse matrices, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 658-679.
27. E. Ng, A scheme for handling rank-deficiency in the solution of sparse linear least squares problems, SIAM J. Sci. Statist. Comput., 12 (1991), p p. 1173-1183.
28. M. K. Ng, Iterative Methods for Toeplitz Systems (Numerical Mathematics and Scientific Computation), Oxford University Press, New York, 2004.
29. C. C. PAIGE AND M. A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
30. D. J. Pierce AND J. G. Lewis, Sparse multifrontal rank revealing QR factorization,SIAMJ. Matrix Anal. Appl., 18 (1997), pp. 159-180.
31. P.A. WEDIN, Perturbation theory for pseudo-inverses, BIT, 13 (1973), pp. 217-232.