Skip to main content
Log in

On the optimization of approximate integration by Monte Carlo methods

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We solve the problem of optimization of monte Carlo methods for approximate integration over an arbitrary absolutely continuous measure. We propose a convenient model of Monte Carlo methods which uses the notion of transition probability.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. M. Ermakov, Monte Carlo Method and Related Problems [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  2. N. S. Bakhvalov, “On the approximate determination of multiple integrals,” Vestn. Mosk. Univ., No. 4, 3–18 (1959).

    Google Scholar 

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

    Google Scholar 

  4. E. Novak, “Optimal linear randomized methods for linear operators in Hilbert spaces,” J. Complexity, 8, 22–36 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Mathe, Random Approximation of Finite Sums, Preprint No. 11, Inst. Appl. Anal. and Stochast. (1992).

  6. P. Mathe, “A minimax principle for the optimal error of Monte Carlo methods,” Constr. Approx., 9, 23–29 (1993).

    Article  MATH  MathSciNet  Google Scholar 

  7. V. F. Babenko, “On the optimization of approximate integration by Monte Carlo methods,” in: The Theory of Approximation and Problems of Computational Mathematics, Abstracts of the International Conference on the Occasion of the 75th anniversary of the Dnepropetrovsk State University (Dnepropetrovsk, May 26–28, 1993) [in Ukrainian], Dnepropetrovsk University, Dnepropetrovsk (1993), p. 11.

    Google Scholar 

  8. V. F. Babenko, “On optimization of quadrature formulae,” in: Algorithms and Complexity for Continuous Problems, Dagstuhl-Seminar-Report, 101, 17.10–21.10 (1994), p. 3.

  9. P. Mathe, “The optimal error of Monte Carlo integration,” in: Algorithms and Complexity for Continuous Problems, Dagstuhl-Seminar-Report, 101, 17.10–21.10 (1994), p. 11.

  10. K. R. Parthasarathy, Introduction to the Theory of Probability and the Measure Theory, New Delhi (1980).

Download references

Authors

Additional information

Dnepropetrovsk University, Dnepropetrovsk. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 49, No. 4, pp. 475–480, April, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babenko, V.F. On the optimization of approximate integration by Monte Carlo methods. Ukr Math J 49, 523–528 (1997). https://doi.org/10.1007/BF02487314

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation