The structure of iterative methods for symmetric linear discrete ill-posed problems Articles uri icon

publication date

  • March 2014

start page

  • 129

end page

  • 145

issue

  • 1

volume

  • 54

international standard serial number (ISSN)

  • 0006-3835

electronic international standard serial number (EISSN)

  • 1572-9125

abstract

  • 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.

keywords

  • ill-posed problem; iterative method; truncated iteration