Abstract
In this paper we propose a modification of the projection scheme for solving ill-posed problems. We show that this modification allows to obtain the best possible order to accuracy of Tikhonov Regularization using an amount of information which is far less than for the standard projection technique.
Zusammenfassung
In dieser Arbeit wird eine Modifizierung des Projektionsschemas zur Lösung inkorrekt gestellter Probleme vorgeschlagen. Wir zeigen, daß diese Modifizierung es ermöglicht, eine Genauigkeit der Tikhonov-Regularisierung von bestmöglicher Ordnung zu erhalten, wobei man eine wesentlich kleinere Menge von Informationen benutzt als beim Standard-Projektionsschema.
Similar content being viewed by others
References
Alpert, B., Beylkin, G., Coifman, R., Rokhlin, V.: Wavelet-like bases for the fast solution of second-kind integral equations. SIAM J. Sci. Comput.14, 159–184 (1993).
Hackbusch, W., Sauter, S. A.: On the efficient use of Galerkin method to solve Fredhom integral equations. Technical Report 92-18, Institut für Praktische Mathematik, Universität Kiel, 1992.
Heinrich, S.: Random approximation in numerical analysis. In: Functional analysis (Bierstedt, K. D., Pietsch, A., Ruess, W. M. Vogt, D., eds), pp. 123–171. New York: Marcel Dekker 1994.
Ivanov, V. K., Vasin, V. V., Tanana, V. P.: Theory of linear ill-posed problems with its applications. Moscow, Nauka 1978.
Pereverzev, S. V.: On the complexity of the problem of finding solutions of Fredholm equations of the second kind with differentiable kernels I, II (in Russian). Ukrain. Mat., Sh.40, 84–91 (1988).
Plato, R., Vainikko, G.: On the regularization of projection methods for solving ill-posed problems. Numer. Math.57, 63–70 (1990).
Vainikko, G.L.: The discrepancy principle for a class of regularization methods. USSR Comput. Maths. Math. Phys.22, 1–19 (1982).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pereverzev, S.V. Optimization of projection methods for solving ill-posed problems. Computing 55, 113–124 (1995). https://doi.org/10.1007/BF02238096
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02238096