Skip to main content

A New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2907))

Abstract

Bachvalov proved that the optimal order of convergence of a Monte Carlo method for numerical integration of functions with bounded kth order derivatives is \(\mathop{O}\left(N^{-\frac{k}{s}-\frac{1}{2}}\right)\), where s is the dimension. We construct a new Monte Carlo algorithm with such rate of convergence, which adapts to the variations of the sub-integral function and gains substantially in accuracy, when a low-discrepancy sequence is used instead of pseudo-random numbers.

Theoretical estimates of the worst-case error of the method are obtained.

Experimental results, showing the excellent parallelization properties of the algorithm and its applicability to problems of moderately high dimension, are also presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atanassov, E., Dimov, I.: A new optimal Monte Carlo method for calculating integrals of smooth functions. Monte Carlo Methods and Applications 5(2), 149–167 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bachvalov, N.S.: On the approximate computation of multiple integrals. Vestnik Moscow State University, Ser. Mat., Mech. 4, 3–18 (1959)

    Google Scholar 

  3. Bachvalov, N.S.: Average Estimation of the Remainder Term of Quadrature Formulas. USSR Comput. Math. and Math. Phys. 1(1), 64–77 (1961)

    Google Scholar 

  4. Caflisch, R.E., Morokoff, W., Owen, A.B.: Valuations of mortgage backed securities using Brownian bridges to reduce effective dimension. Journal of Computational Finance 1, 27–46 (1997)

    Google Scholar 

  5. Capstick, S., Keister, B.D.: Multi dimensional Quadrature Algorithms at Higher Degree and/or Dimension, http://www.scri.fsu.edu/~capstick/papers/quad.ps

  6. Dimov, I., Karaivanova, A., Georgieva, R., Ivanovska, S.: Parallel Importance Separation and Adaptive Monte Carlo Algorithms for Multiple Integrals. In: Dimov, I.T., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 99–107. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Drmota, M., Tichy, R.F.: Sequences, Discrepancies and Applications. Lecture Notes on Mathematics, vol. 1651. Springer, Berlin (1997)

    MATH  Google Scholar 

  8. Entacher, K., Uhl, A., Wegenkittl, S.: Linear congruential generators for parallel Monte Carlo: the leap-frog case. Monte Carlo Meth. Appl. 4, 1–16 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kuipers, L., Niederreiter, H.: Uniform distribution of sequences. John Wiley & sons, New York (1974)

    MATH  Google Scholar 

  10. Kjurkchiev, N., Sendov, B.I., Andreev, A.: Numerical Solution of Polynomial Equations. In: Ciarlet, P.G., Lions, J.L. (eds.) Handbook of Numerical Analysis, Solution of Equations in R n (Part 2), vol. 3, North-Holland, Amsterdam (1994)

    Google Scholar 

  11. Van Loan, C., Golub, G.: Matrix Computations, 3rd edn. The John Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  12. Owen, A.B.: Scrambled Net Variance for Integrals of Smooth Functions. Annals of Statistics 25(4), 1541–1562 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  13. Owen, A.B.: The dimension distribution and quadrature test functions (November 2001), wwwstat.stanford.edu/~owen/reports

  14. Schmid, W.C., Uhl, A.: Techniques for parallel quasi-Monte Carlo integration with digital sequences and associated problems. Math. and Comp. in Sim. 55, 249–257 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Schuerer, R.: A comparison between (quasi-)Monte Carlo and cubature rule based method for solving high-dimensional integration problems. Math. and Comp. in Sim. 62(3-6), 509–517 (2003)

    Article  MATH  Google Scholar 

  16. Sloan, I.H., Wozniakowski, H.: When are quasi-Monte Carlo Algorithms efficient in high-dimensional integration. Journal of Complexity 14, 1–33 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Soboĺ, M.: Monte Carlo Methods. Nauka, Moscow (1973)

    Google Scholar 

  18. Soboĺ, M., Asotsky, D.I.: One more experiment on estimating high-dimensional integrals by quasi-Monte Carlo methods. Math. and Comp. in Sim. 62(3-6), 255–275 (2003)

    Article  MATH  Google Scholar 

  19. Software/MULTST, http://www.math.wsu.edu/math/faculty/genz/homepage

  20. Takev, M.D.: On Probable Error of the Monte Carlo Method for Numerical Integration. Mathematica Balkanica (New Series) 6, 231–235 (1992)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Atanassov, E.I., Dimov, I.T., Durchova, M.K. (2004). A New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions. In: Lirkov, I., Margenov, S., Waśniewski, J., Yalamov, P. (eds) Large-Scale Scientific Computing. LSSC 2003. Lecture Notes in Computer Science, vol 2907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24588-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24588-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21090-0

  • Online ISBN: 978-3-540-24588-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics