131
Views
16
CrossRef citations to date
0
Altmetric
Original Articles

On Lavrentiev Regularization for Ill-Posed Problems in Hilbert Scales

&
Pages 531-555 | Published online: 31 Aug 2006
 

Abstract

In this article we study the problem of identifying the solution x of linear ill-posed problems Ax = y in a Hilbert space X where instead of exact data y noisy data y δX are given satisfying with known noise level δ. Regularized approximations are obtained by the method of Lavrentiev regularization in Hilbert scales, that is, is the solution of the singularly perturbed operator equation where B is an unbounded self-adjoint strictly positive definite operator satisfying . Assuming the smoothness condition we prove that the regularized approximation provides order optimal error bounds (i) in case of a priori parameter choice for and (ii) in case of Morozov's discrepancy principle for sp. In addition, we provide generalizations, extend our study to the case of infinitely smoothing operators A as well as to nonlinear ill-posed problems and discuss some applications.

Acknowledgments

J. Janno gratefully acknowledges the support received from the Deutsche Forschungs-gemeinschaft (DFG) to visit the Department of Mathematics and Natural Sciences of the University of Applied Sciences Zittau/Görlitz from June until August 2002, under the grant 436 EST 17/1/02. J. Janno gratefully acknowledges also the support of the Estonian Science Foundation, grant 5006.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.