Stopping criteria for the iterative solution of linear least squares problems

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 2, 2009, Pages 831-852

  Chang, X W ^a   Paige, C C ^a   Titley Peloquin, D ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Backward perturbation analysis; Iterative methods; Large sparse matrix problems; Linear least squares; Stoppin criteria

Indexed keywords

BACKWARD PERTURBATION ANALYSIS; ITERATIVE SOLUTIONS; LARGE SPARSE MATRIX; LINEAR LEAST SQUARES; LINEAR LEAST SQUARES PROBLEMS; NUMERICAL EXAMPLE; PERTURBATION ANALYSIS; STOPPING CRITERIA; SUFFICIENT CONDITIONS;

CHANNEL CAPACITY; ONLINE SEARCHING; SURFACE RECONSTRUCTION;

ITERATIVE METHODS;

EID: 72449121807     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/080724071     Document Type: Article

References (18)

1. M. ARIOLI AND S. GRATTON, Least-Squares Problems, Normal Equations, and Stopping Criteria for the Conjugate Gradient Method, Technical report RAL-TR-2008-008, Rutherford Appleton Laboratory, Oxfordshire, UK, 2008.
2. Å. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
3. X.-W. CHANG, C. C. PAIGE, AND D. TITLEY-PELOQUIN, Characterizing matrices that are consistent with given solutions, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1406-1420.
4. S.-C. CHOI, Iterative Methods for Singular Linear Equations and Least-Squares Problems, Ph.D. thesis, Stanford University, Stanford, CA, 2006.
5. G. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal., 2 (1965), pp. 205-224.
6. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
7. J. F. GRCAR, Optimal Sensitivity Analysis of Linear Least Squares, Technical report LBNL- 52434, Lawrence Berkeley National Laboratory, Berkeley, CA, 2003.
8. M. GU, Backward perturbation bounds for linear least squares problems,SIAMJ.MatrixAnal. Appl., 20 (1998), pp. 363-372.
9. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
10. The Matrix Market, available online at http://math.nist.gov/MatrixMarket.
11. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
12. 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.
13. C. C. PAIGE AND M. A. SAUNDERS, Algorithm 583, LSQR: Sparse linear equations and sparse least squares problems, ACM Trans. Math. Software, 8 (1982), pp. 195-209.
14. J. L. RIGAL AND J. GACHES, On the compatibility of a given solution with the data of a linear system, J. ACM, 14 (1967), pp. 543-548.
15. G. W. STEWART, On the perturbation of pseudo-inverses, projections and linear least squares problems, SIAM Rev., 19 (1977), pp. 634-662.
16. G. W. STEwART, Research, development, and LINPACK, in Mathematical Software III, J. R., Rice, ed., Academic Press, New York, 1977, pp. 1-14.
17. Z. STRAKOŠ AND P. TICHY, On error estimation in the conjugate gradient method and why it works infinite precision computations, Electron. Trans. Numer. Anal., 13 (2002), pp. 56-80.
18. B. WALDÉN, R. KARLSON, AND J.-G. SUN, Optimal backward perturbation bounds for the linear least squares problem, Numer. Linear Algebra Appl., 2 (1995), pp. 271-286.