Skip to main content
SpringerLink
Log in

Information aspects in the theory of approximation and recovery of operators

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We present a brief review of new directions in the theory of approximation which are associated with the information approach to the problems of optimum recovery of mathematical objects on the basis of discrete information. Within the framework of this approach, we formulate three problems of recovery of operators and their values. In the case of integral operator, we obtain some estimates of the error.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Kolmogoroff, “Zur Grössenordnung des restgliedes Fourierscher Reihen differenzierbarer Funktionen,”Ann. Math.,36, 521–536 (1935).

    Article  MathSciNet  Google Scholar 

  2. J. Favard, “Sur l’approximation des funktions periodiques par des polinomes trigonometriques,”Comptes-Rendus Acad. Sci. Paris,203, 1122–1124 (1936).

    MATH  Google Scholar 

  3. S. M. Nikolskii, “Approximation of periodic function by trigonometric polynomials,”Tr. Mat. Inst. Akad. Nauk SSSR,15, 1–76 (1945).

    Google Scholar 

  4. A. Kolmogoroff, “Über die besste Annäherung von Funktionen einer gegebenen Funktionklassen,”Ann. Math.,37, 107–110 (1936).

    Article  MathSciNet  Google Scholar 

  5. V. M. Tikhomirov, “Widths of sets in functional spaces and the theory of best approximations,”Usp. Mat. Nauk,15, No. 3, 81–120 (1960).

    Google Scholar 

  6. V. M. Tikhomirov,Some Problems in the Theory of Approximation [in Russian], Moscow University, Moscow (1976).

    Google Scholar 

  7. N. P. Korneichuk,Extremum Problems in the Theory of Approximation [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  8. V. M. Tikhomirov, “Approximation theory,” in:VINITI Series in Contemporary Problems in Mathematics [in Russian], Vol. 14, VINITI, Moscow (1987), pp. 103–260.

    Google Scholar 

  9. N. P. Korneichuk, “Optimum recovery of functions and their derivatives in the metricL p ,” in:Theory of Cubage Formulas and Computational Mathematics [in Russian], Nauka, Novosibirsk (1980), pp. 152–157.

    Google Scholar 

  10. N. P. Korneichuk, “Widths of classes of continuous and differentiable functions inL p and optimum methods for encoding and recovery of functions and their derivatives,”Izv. Akad. Nauk SSSR, Ser. Mat.,45, No. 2, 266–290 (1981).

    MathSciNet  Google Scholar 

  11. N. P. Korneichuk,Splines in the Theory of Approximation [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  12. N. P. Korneichuk,Exact Constants in the Theory of Approximation [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  13. N. P. Korneichuk, “Information widths,”Ukr. Mat. Zh.,47, No. 11, 1506–1518 (1995).

    MathSciNet  Google Scholar 

  14. N. P. Korneichuk, “Optimization of active algorithms for recovery of monotonic functions from Hölder’s class,”J. Complexity,10, 265–269 (1994).

    Article  MATH  MathSciNet  Google Scholar 

  15. N. P. Korneichuk, “Optimization of adaptive algorithms for the recovery of monotonic functions from the classH ω,”Ukr. Mat. Zh.,45, No. 12, 1627–1634 (1993).

    MATH  MathSciNet  Google Scholar 

  16. N. P. Korneichuk, “Informativeness of functionals,”Ukr. Mat. Zh.,46, No. 9, 1156–1163 (1994).

    MATH  MathSciNet  Google Scholar 

  17. A.G. Vitushkin,Estimation of the Complexity of the Problem of Tabulation [in Russian], Fizmatgiz, Moscow (1959).

    Google Scholar 

  18. A. N. Kolmogorov, “Various approaches to the estimation of the complexity of an approximate definition and calculation of functions,” in:Proceedings of the International Congress of Mathematicians, Stockholm (1963), pp. 369–376.

  19. J. F. Traub and H. Wozniakowski,A General Theory of Optimal Algorithms, Academic Press, New York (1980).

    MATH  Google Scholar 

  20. J. F. Traub, G. W. Wasilkowski, and H. Wozniakowski,Information, Uncertainty, Complexity, Addison-Wesley, London (1983).

    MATH  Google Scholar 

  21. J. F. Traub, G. W. Wasilkowski, and H. Wozniakowski,Information-Based Complexity, Academic Press, New York (1988).

    MATH  Google Scholar 

  22. N. P. Korneichuk, “Complexity of approximation problems,”Ukr. Mat. Zh.,48, No. 12, 1683–1694 (1996).

    MathSciNet  Google Scholar 

  23. N. P. Korneichuk, “On complexity of approximation problems,”E. J. Approxim.,3, No. 3, 251–273 (1997).

    MATH  MathSciNet  Google Scholar 

  24. S. B. Stechkin, “Best approximation of linear operators,”Mat. Zametki,1, No. 2, 137–148 (1967).

    MathSciNet  Google Scholar 

  25. V. V. Arestov, “Approximation of operators of the type of convolution by linear bounded operators,”Trudy Mat. Inst. Akad. Nauk SSSR,145, 3–19 (1980).

    MATH  MathSciNet  Google Scholar 

  26. N. P. Korneichuk, “Encoding and recovery of operator values,”J. Complexity,8, 79–91 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  27. N. P. Korneichuk, “On the optimum recovering of operator values,”Ukr. Mat. Zh.,46, No. 10, 1383–1389 (1994).

    MathSciNet  Google Scholar 

  28. M. Sh. Shabozov, “Best and best one-sided approximation of the kernel of a biharmonic equation and optimum recovery of values of operators,”Ukr. Mat. Zh.,47, No. 11, 1549–1557 (1995).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Authors
  1. N. P. Korneichuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Institute of Mathematics, Ukrainian Academy of Sciences, Kiev. Translated from Ukrainskii Matematicheskii Zhurnal. Vol. 51, No. 3, pp. 314–327, March, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Korneichuk, N.P. Information aspects in the theory of approximation and recovery of operators. Ukr Math J 51, 353–365 (1999). https://doi.org/10.1007/BF02592473

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592473

Keywords

Search

Navigation