Abstract
We determine the exact order of the minimum radius of information in the logarithmic scale for Fredholm integral equations of the second kind with periodic analytic kernels and free terms. We show that the information complexity of the solution of Fredholm equations with analytic kernels is greater in order than the complexity of the approximation of analytic functions. This distinguishes the analytic case from the case of finite smoothness.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. S. Bakhvalov, “On optimal methods for specifying information in the solution of differential equations,”Zh. Vych. Mat. Mat. Fiz,2, No. 4, 559–592 (1962).
V. V. Ivanov, “On optimal algorithms for the numerical solution of singular integral equations,” in:Continuum Mechanics and Related Problems of Analysis [in Russian], Nauka, Moscow (1972), pp. 209–219.
S. V. Pereverzev, “On the complexity of the problem of finding solutions of Fredholm equations of the second kind with smooth ker- nels,”Ukr. Mat. Zh.,41, No. 2, 189–193 (1989).
S. V. Pereverzev, “Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels,”Sib. Mat. Zh.,32, No. 1, 107–115 (1991).
K. Frank, S. Heinrich, and S. V. Pereverzev,The Exact Order of Information Complexity for Fredholm Equations of the Second Kind with Kernels from Sobolev Classes, Universitat Kaiserslautern, Kaiserslautern 1994.
S. V. Pereverzev and C. C. Sharipov, “Information complexity of the equations of the second kind with compact operators in Hilbert space,”J. Complexity,8, No. 2, 176–202 (1992).
S. V. Pereverzev and K. Sh. Makhkamov, “Galerkin’s information, hyperbolic cross, and complexity of operator equations,”Ukr. Mat. Zh.,43, No. 5, 639–648 (1991).
J. F. Traub and H. Wozniakowski,A General Theory of Optimal Algorithms, Academic Press, New York 1980.
N. P. Korneichuk, “Theory of approximations and the problem of optimization of calculations,”Ukr. Mat. Zh.,42, No. 5, 579–593 (1990).
H. Wozniakowski, “Information-based complexity,” in:Ann. Rev. Comput. Sci.,1, 318–380 (1986).
S. Heinrich, “Complexity of integral equations and relations to s-numbers,”J. Complexity,9, No. 2, 141–153 (1993).
S. N. Zaliznyak, Yu. I. Mel’nik, and Yu. K. Podlipenko, “On the approximate solution of integral equations in potential theory,”Ukr. Mat. Zh.,33, No. 3, 385–391 (1981).
V. M. Tikhomirov,Some Problems in the Theory of Approximation [in Russian], Moscow University, Moscow (1976).
A. Pietsch,Operator Ideals, Springer, Berlin 1978.
L. V. Kantorovich and G. P. Akilov,Functional Analysis [in Russian], Nauka, Moscow 1977.
K. I. Babenko (editor),Theoretical Foundations and Construction of Numerical Algorithms for Problems of Mathematical Physics [in Russian], Nauka, Moscow 1979.
Rights and permissions
About this article
Cite this article
Pereverzev, S.V., Azizov, M. Optimal methods for specifying information in the solution of integral equations with analytic kernels. Ukr Math J 48, 733–741 (1996). https://doi.org/10.1007/BF02384240
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02384240