The structure of iterative methods for symmetric linear discrete ill-posed problems
- 184 Downloads
The iterative solution of large linear discrete ill-posed problems with an error contaminated data vector requires the use of specially designed methods in order to avoid severe error propagation. Range restricted minimal residual methods have been found to be well suited for the solution of many such problems. This paper discusses the structure of matrices that arise in a range restricted minimal residual method for the solution of large linear discrete ill-posed problems with a symmetric matrix. The exploitation of the structure results in a method that is competitive with respect to computer storage, number of iterations, and accuracy.
KeywordsIll-posed problem Iterative method Truncated iteration
Mathematics Subject Classification (2000)65F10 65F22
We would like to thank the referees for comments. The work of F. M. was supported by Dirección General de Investigación Científica y Técnica, Ministerio de Economía y Competitividad of Spain under grant MTM2012-36732-C03-01. Work of L. R. was supported by Universidad Carlos III de Madrid in the Department of Mathematics during the academic year 2010-2011 within the framework of the Chair of Excellence Program and by NSF grant DMS-1115385.
- 5.Calvetti, D., Reichel, L., Zhang, Q.: Conjugate gradient algorithms for symmetric inconsistent linear systems. In: Brown, J.D., Chu, M.T., Ellison, D.C., Plemmons, R. J. (ed.) Proceedings of the Cornelius Lanczos International Centenary Conference, pp. 267–272. SIAM, Philadelphia (1994)Google Scholar
- 7.Gautschi, W.: Orthogonal polynomials: computation and approximation. Oxford University Press, Oxford (2004)Google Scholar
- 12.Kautsky, J., Golub, G.H.: On the calculation of Jacobi matrices. Linear Algebra Appl. 52–53, 439–455 (1983)Google Scholar