Stability of conjugate gradient and lanczos methods for linear least squares problems

SIAM Journal on Matrix Analysis and Applications

Volumn 19, Issue 3, 1998, Pages 720-736

  Björck, Åke ^a   Elfving, Tommy ^a   Strakoš, Zdeněk ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Conjugate gradient method; Least squares; Numerical stability

Indexed keywords

EID: 0041192970     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089547989631202X     Document Type: Article

References (24)

1. Å. BJÖRCK, Conjugate Gradient Methods for Sparse Least Squares Problems, Unpublished notes, Computer Science Department, Stanford University, Stanford, CA, 1979.
2. Å. BJÖRCK, Component-wise perturbation analysis and errors bounds for linear least squares solutions, BIT, 31 (1991), pp. 238-244.
3. Å. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, PA, 1996.
4. Å. BJÖRCK, E. GRIMME, AND P. VAN DOOREN, An implicit bidiagonalization algorithm for ill-posed systems, BIT, 34 (1994), pp. 510-534.
5. Y. T. CHEN, Iterative Methods for Linear Least Squares Problems, Technical report CS-75-04, Department of Computer Science, University of Waterloo, Waterloo, ON, Canada, 1975.
6. E. J. CRAIG, The N-step iteration procedures, J. Math. Phys., 34 (1955), pp. 64-73.
7. T. ELFVING, On the Conjugate Gradient Method for Solving Linear Least Squares Problems, Report LiTH-MAT-R-78-3, Department of Math., Linköping University, Linköping, Sweden, 1978.
8. R. W. FREUND, G. H. GOLUB, AND N. NACHTIGAL, Iterative solution of linear systems, Acta Numerica, (1991), pp. 57-100.
9. G. H. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal. Ser. B, 2 (1965), pp. 205-224.
10. A. GREENBAUM, Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences, Linear Algebra Appl., 113 (1989), pp. 7-63.
11. A. GREENBAUM, Estimating the attainable accuracy of recursively computed residual methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 535-551.
12. A. GREENBAUM AND Z. STRAKOŠ, Predicting the behavior of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 121-137.
13. M. T. HEATH, Numerical methods for large sparse linear least squares problems. SIAM J. Sci. Statist. Comput., 5 (1984), pp. 497-513.
14. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stds., B49 (1952), pp. 409-436.
15. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
16. N. J. HIGHAM AND P. A. KNIGHT, Finite precision behavoir of stationary iteration for solving singular systems, Linear Algebra Appl., 192 (1993), pp. 165-186.
17. P. LÄUCHLI, Iterative Lösung und Fehlerabschätzung in der Ausgleichrechnung, ZAMP, 10 (1959), pp. 245-280.
18. C. L. LAWSON, Sparse Matrix Methods based on Orthogonality and Conjugacy, Technical mem. 33-627, Jet Propulsion Lab., California Institute of Technology, 1973.
19. C. C. PAIGE, Bidiagonalization of matrices and solution of linear equations, SIAM J. Numer. Anal., 11 (1974), pp. 197-209.
20. 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.
21. J. K. REID, On the method of conjugate gradients for the solution of large systems of linear equations, in Large Sparse Sets of Linear Equations, J. K. Reid, ed., Academic Press, New York, 1971, pp. 231-254.
22. D. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
23. E. STIEFEL, Ausgleichung ohne Aufstellung der Gausschen Normalgleichungen, Wiss. Z. Technische Hochschule Dresden, 2 (1952/53), pp. 441-442.
24. Z. STRAKOŠ, On the real convergence, of the conjugate gradient, method., Linear Algebra Appl., 154/156 (1991), pp. 535-549.