Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I
- 21 Downloads
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.
KeywordsProjection Method Optimal Order Projection Algorithm Information Complexity Elementary Operation
Unable to display preview. Download preview PDF.
- 1.J. F. Traub and H. Wozniakowski, A General Theory of Optimal Algorithms, Academic Press, New York (1982).Google Scholar
- 2.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.Google Scholar
- 4.S. Pereverzev, Optimization of Methods for Approximate Solution of Operator Equations, Nova, New York (1996).Google Scholar
- 6.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).Google Scholar
- 8.A. G. Werschulz, What is the Complexity of Ill-Posed Problems?, Columbia University, New York (1985).Google Scholar
- 10.A. N. Tikhonov and V. Ya. Arsenin, Solutions of Ill-Posed Problems [in Russian], Nauka, Moscow (1979); English translation: Winston-Wiley, Washington (1977).Google Scholar
- 11.G. M. Vainikko and A. Yu. Veretennikov, Iteration Procedures in Ill-Posed Problems [in Russian], Nauka, Moscow (1986).Google Scholar