Abstract
We construct a new system of discretization of the Fredholm integral equations of the first kind with linear compact operators A and free terms from the set Range (A(A*A)V), v > 1/2. The approach proposed enables one to obtain the optimal order of error on such classes of equations by using a considerably smaller amount of discrete information as compared with standard schemes.
Similar content being viewed by others
References
J. F. Traub and H. Wozniakowski, A General Theory of Optimal Algorithms, Academic Press, New York (1982).
N. P. Korneichuk, “On approximation of convolutions of periodic functions,” in: Problems of Analysis and Approximations [in Russian], Institute of Mathematics, Ukrainian Academy of Sciences, Kiev (1989), pp. 76–80.
M. Shabozov, “On the recovery of solutions of Neuman’s boundary-value problem,” East. J. Approx., 2, No. 3, 369–379 (1996).
S. Pereverzev, Optimization of Methods for Approximate Solution of Operator Equations, Nova, New York (1996).
R. Plato and G. Vainikko, “On the regularization of projection methods for solving ill-posed problems,” Numer. Math., 57, 63–70 (1990).
R. Plato and G. Vainikko, “On the regularization of the Ritz-Galerkin method for solving ill-posed problems,” Uchen. Zap. Tart. Univ., Issue 868, 3–17 (1989).
S. Pereverzev, “Optimization of projection methods for solving ill-posed problems,” Computing, 55, No. 2, 113–124 (1995).
A. G. Werschulz, What is the Complexity of Ill-Posed Problems?, Columbia University, New York (1985).
H. Wozniakowski, “Information based complexity,” Ann. Rev. Comput. Sci, 1, 319–380 (1986).
A. N. Tikhonov and V. Ya. Arsenin, Solutions of Ill-Posed Problems [in Russian], Nauka, Moscow (1979); English translation: Winston-Wiley, Washington (1977).
G. M. Vainikko and A. Yu. Veretennikov, Iteration Procedures in Ill-Posed Problems [in Russian], Nauka, Moscow (1986).
A. B. Bakushinskii, “One general method for the construction of regularizing algorithms for linear ill-posed equations in a Hilbert space,” Zh. Vychisl. Mat. Mat. Fiz., 7, No. 3, 672–677 (1967).
S. Pereverzev and C. Sharipov, “Information complexity of equations of the second kind with compact operators in Hilbert space,” J. Complexity, 8, 176–202 (1992).
Author information
Authors and Affiliations
Additional information
Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 5, pp. 699–711, May, 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. I. Ukr Math J 50, 795–808 (1998). https://doi.org/10.1007/BF02514332
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02514332