Skip to main content

Quasi-random Walks on Balls Using C.U.D. Sequences

  • Conference paper
  • 2213 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4310))

Abstract

This paper presents work on solving elliptic BVPs problems based on quasi-random walks, by using a subset of uniformly distributed sequences—completely uniformly distributed (c.u.d.) sequences. This approach is novel for solving elliptic boundary value problems. The enhanced uniformity of c.u.d. sequences leads to faster convergence. We demonstrate that c.u.d. sequences can be a viable alternative to pseudorandom numbers when solving elliptic boundary value problems. Analysis of a simple problem in this paper showed that c.u.d. sequences achieve better numerical results than pseudorandom numbers, but also have the potential to converge faster and so reduce the computational burden.

Supported by the Ministry of Education and Science of Bulgaria under Grant No. I1405/04 and by the EC FP6 under Grant No: INCO-CT-2005-016639 of the project BIS-21++.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Caflisch, R.E.: Monte Carlo and quasi-Monte Carlo methods. Acta Numerica 7, 1–49 (1998)

    Article  MathSciNet  Google Scholar 

  2. Chaudhary, S.: Acceleration of Monte Carlo Methods using Low Discrepancy Sequences. Dissertation, University of California, Los Angeles (2004)

    Google Scholar 

  3. Dimov, I.T., Gurov, T.V.: Estimates of the computational complexity of iterative Monte Carlo algorithm based on Green’s function approach. Mathematics and Computers in Simulation 47, 183–199 (1998)

    Article  MathSciNet  Google Scholar 

  4. Ermakov, S., Nekrutkin, V., Sipin, V.: Random Processes for solving classical equations of the mathematical physics. Nauka, Moscow (1984)

    Google Scholar 

  5. Entacher, K., Hellekalek, P., L’Ecuyer, P.: Quasi-Monte Carlo Node Sets from Linear Congruential Generators. In: Niederreiter, H., Spanier, J. (eds.) Monte Carlo and Quasi-Monte Carlo methods 1998, pp. 188–198. Springer, Berlin (2000)

    Google Scholar 

  6. Hofmann, N., Mathe, P.: On Quasi-Monte Carlo Simulation of stochastic Differential equations. Mathematics of Computation 66, 573–589 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Karaivanova, A., Mascagni, M., Simonov, N.A.: Solving BVPs using quasirandom walks on the boundary. In: Lirkov, I., et al. (eds.) LSSC 2003. LNCS, vol. 2907, pp. 162–169. Springer, Heidelberg (2004)

    Google Scholar 

  8. Knuth, D.E.: The Art of Computer Programming, vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading (1997)

    Google Scholar 

  9. Knuth, D.E.: Construction of a random sequence. BIT 4, 250–264 (1965)

    Google Scholar 

  10. Korobov, N.M.: Bounds of trigonometric sums involving completely uniformly distributed functions. Soviet. Math. Dokl. 1, 923–926 (1964)

    MathSciNet  Google Scholar 

  11. Korobov, N.M.: On some topics of uniform distribution. Izvestia Akademii Nauk SSSR, Seria Matematicheskaja 14, 215–238 (1950)

    MATH  MathSciNet  Google Scholar 

  12. Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. John Wiley and Sons, New York (1974)

    MATH  Google Scholar 

  13. Lecot, C., Tuffin, B.: Quasi-Monte Carlo Methods for Estimating Transient Measures of Discrete Time Markov Chains. In: Fifth International Conference on Monte Carlo and Quasi- Monte Carlo Methods in Scientific Computing, pp. 329–344. Springer, Heidelberg (2002)

    Google Scholar 

  14. Levin, M.B.: Discrepancy Estimates of Completely Uniformly Distributed and Pseudorandom Number Sequences. International Mathematics Research Notices 22, 1231–1251 (1999)

    Article  Google Scholar 

  15. Loh, W.L.: On the asymptotic distribution of scrambled net quadrature. Annals of Statistics 31, 1282–1324 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Mikhailov, G.A.: New Monte Carlo Methods with Estimating Derivatives, Utrecht, The Netherlands (1995)

    Google Scholar 

  17. Mascagni, M., Karaivanova, A., Hwang, C.: Monte Carlo Methods for elliptic boundary Value Problems. In: Proceedings of MCQMC 2002: Monte Carlo and Quasi-Monte Carlo Methods 2002, pp. 345–355. Springer, Heidelberg (2004)

    Google Scholar 

  18. Morokoff, W.: Generating Quasi-Random Paths for Stochastic Processes. SIAM Rev. 40(4), 765–788 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  19. Miranda, C.: Equasioni alle dirivate parziali di tipo ellittico. Springer, Berlin (1955)

    Google Scholar 

  20. Morokoff, W., Caflisch, R.E.: A quasi-Monte Carlo approach to particle simulation of the heat equation. SIAM J. Numer. Anal. 30, 1558–1573 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  21. Niederreiter, H.: Random Number Generations and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  23. Owen, A.B., Tribble, S.: A quasi-Monte Carlo Metroplis Algorithm. Proceedings of the National Academy of Sciences of the United States of America 102, 8844–8849 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  24. Sabelfeld, K.: Monte Carlo Methods in Boundary Value Problems. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  25. Shparlinskii, I.E.: On a Completely Uniform Distribution. USSR Computational Mathematics and Mathematical Physics 19, 249–253 (1979)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Todor Boyanov Stefka Dimova Krassimir Georgiev Geno Nikolov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Karaivanova, A., Chi, H., Gurov, T. (2007). Quasi-random Walks on Balls Using C.U.D. Sequences. In: Boyanov, T., Dimova, S., Georgiev, K., Nikolov, G. (eds) Numerical Methods and Applications. NMA 2006. Lecture Notes in Computer Science, vol 4310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70942-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70942-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70940-4

  • Online ISBN: 978-3-540-70942-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics