Skip to main content
Log in

Iterative exponential filtering for large discrete ill-posed problems

  • Original article
  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

We describe a new iterative method for the solution of large, very ill-conditioned linear systems of equations that arise when discretizing linear ill-posed problems. The right-hand side vector represents the given data and is assumed to be contaminated by measurement errors. Our method applies a filter function of the form \(\varphi_\beta(t):=1-\exp(-\beta t^2)\) with the purpose of reducing the influence of the errors in the right-hand side vector on the computed approximate solution of the linear system. Here \(\beta\) is a regularization parameter. The iterative method is derived by expanding \(\varphi_\beta(t)\) in terms of Chebyshev polynomials. The method requires only little computer memory and is well suited for the solution of large-scale problems. We also show how a value of \(\beta\) and an associated approximate solution that satisfies the Morozov discrepancy principle can be computed efficiently. An application to image restoration illustrates the performance of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received January 25, 1997 / Revised version received February 9, 1998 / Published online July 28, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Calvetti, D., Reichel, L. & Zhang, Q. Iterative exponential filtering for large discrete ill-posed problems. Numer. Math. 83, 535–556 (1999). https://doi.org/10.1007/s002119900077

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002119900077

Navigation