Abstract
The optimal order of information complexity is found for certain classes of ill-posed problems.
Similar content being viewed by others
References
S. G. Solodkii, “Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I,” Ukr. Mat. Zh., 50, No. 5, 699–711 (1998).
N. P. Korneichuk, Splines in the Theory of Approximation [in Russian], Nauka, Moscow (1984).
V. M. Tikhomirov, Some Problems of the Theory of Approximation [in Russian], Moscow University, Moscow (1976).
S. Pereverzev, “Optimization of projection methods for solving ill-posed problems,” Computing, 55, No. 2, 113–124 (1995).
Author information
Authors and Affiliations
Additional information
Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 6, pp. 838–844, June, 1998.
Rights and permissions
About this article
Cite this article
Solodkii, S.G. Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. II. Ukr Math J 50, 952–959 (1998). https://doi.org/10.1007/BF02515229
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02515229