Advertisement

Ukrainian Mathematical Journal

, Volume 50, Issue 5, pp 795–808 | Cite as

Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I

  • S. G. Solodkii
Article

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.

Keywords

Projection Method Optimal Order Projection Algorithm Information Complexity Elementary Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. F. Traub and H. Wozniakowski, A General Theory of Optimal Algorithms, Academic Press, New York (1982).Google Scholar
  2. 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
  3. 3.
    M. Shabozov, “On the recovery of solutions of Neuman’s boundary-value problem,” East. J. Approx., 2, No. 3, 369–379 (1996).zbMATHMathSciNetGoogle Scholar
  4. 4.
    S. Pereverzev, Optimization of Methods for Approximate Solution of Operator Equations, Nova, New York (1996).Google Scholar
  5. 5.
    R. Plato and G. Vainikko, “On the regularization of projection methods for solving ill-posed problems,” Numer. Math., 57, 63–70 (1990).zbMATHCrossRefMathSciNetGoogle Scholar
  6. 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
  7. 7.
    S. Pereverzev, “Optimization of projection methods for solving ill-posed problems,” Computing, 55, No. 2, 113–124 (1995).zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    A. G. Werschulz, What is the Complexity of Ill-Posed Problems?, Columbia University, New York (1985).Google Scholar
  9. 9.
    H. Wozniakowski, “Information based complexity,” Ann. Rev. Comput. Sci, 1, 319–380 (1986).CrossRefMathSciNetGoogle Scholar
  10. 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. 11.
    G. M. Vainikko and A. Yu. Veretennikov, Iteration Procedures in Ill-Posed Problems [in Russian], Nauka, Moscow (1986).Google Scholar
  12. 12.
    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).MathSciNetGoogle Scholar
  13. 13.
    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).zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Kluwer Academic/Plenum Publishers 1999

Authors and Affiliations

  • S. G. Solodkii
    • 1
  1. 1.Institute of MathematicsUkrainian Academy of SciencesKiev

Personalised recommendations