Abstract
The iterative solution of linear systems of equations arising from the discretization of illposed problems is the method of choice when the dimension of the problem is so large that factorization of the matrix is either too time-consuming or too memory-demanding.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Golub, G. H. and Kahan, W. (1965). Calculating the singular values and pseudoinverse of a matrix. SIAM J. Numer. Anal. 2, 205—224.
Hansen, P. C. (1998). Rank eeicient and eiscrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, Philadelphia, PA.
Paige, C. C. and Saunders, M. A. (1982). LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Software 8, 43—71.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Doicu, A., Trautmann, T., Schreier, F. (2010). Iterative regularization methods for linear problems. In: Numerical Regularization for Atmospheric Inverse Problems. Springer Praxis Books(). Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05439-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-05439-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05438-9
Online ISBN: 978-3-642-05439-6
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)