Abstract
In this paper, the rate of convergence and the order of accuracy (with respect to the error level in the data) of Tikhonov's method for approximating the minimal-norm least-square solution of an ill-posed operator equation is investigated. It is shown that, in general, this rate of convergence is arbitrarily small. It is further shown how this rate depends on some smoothness properties of the solution. All results describe optimal orders.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Groetsch, C. W.,On the Asymptotic Order of Accuracy of Tikhonov Regularization, Journal of Optimization Theory and Applications (to appear).
Wloka, J.,Funktionalanalysis und Anwendungen, De Gruyter, Berlin, Germany, 1971.
Franklin, J. N.,On Tikhonov's Method for Ill-Posed Problems, Mathematics of Computation, Vol. 28, pp. 889–907, 1970.
Schatten, R.,Norm Ideals of Completely Continuous Operators, Springer, Heidelberg, Germany, 1970.
Schock, E.,Ritz Regularization versus Least-Square Regularization: Solution Methods for Integral Equations of the First Kind, Zeitschrift für Analysis und ihre Anwendungen, Vol. 2, 1985.
Schock, E.,Approximate Solution of Ill-Posed Equations: Arbitrarily Slow Convergence versus Superconvergence, Constructive Methods for the Practical Treatment of Integral Equations, Edited by G. Hämmerlin and K. H. Hoffmann, Birkhäuser-Verlag, Basel, Switzerland, 1984.
Author information
Authors and Affiliations
Additional information
Communicated by M. A. Goldberg
Rights and permissions
About this article
Cite this article
Schock, E. On the asymptotic order of accuracy of Tikhonov regularization. J Optim Theory Appl 44, 95–104 (1984). https://doi.org/10.1007/BF00934896
Issue Date:
DOI: https://doi.org/10.1007/BF00934896