Skip to main content

Solving BVPs Using Quasirandom Walks on the Boundary

  • Conference paper
Large-Scale Scientific Computing (LSSC 2003)

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

Included in the following conference series:

Abstract

The ”random walk on the boundary” Monte Carlo method has been successfully used for solving boundary-value problems. This method has significant advantages when compared to random walks on spheres, balls or a grid, when solving exterior problems, or when solving a problem at an arbitrary number of points using a single random walk. In this paper we study the properties of the method when we use quasirandom sequences instead of pseudorandom numbers to construct the walks on the boundary. Theoretical estimates of the convergence rate are given and numerical experiments are presented in an attempt to confirm the convergence results. The numerical results show that for “walk on the boundary” quasirandom sequences provide a slight improvement over ordinary Monte Carlo.

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

Access this chapter

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

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. Chelson, P.: Quasi-Random Techniques for Monte Carlo Methods. Ph.D. dissertation, The Claremont Graduate School (1976)

    Google Scholar 

  3. Coulibaly, I., Lecot, C.: A quasi-randomized Runge-Kutta method. Math Comput 68, 651–659 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Goursat, E.: A course in mathematical analysis. part 2, vol. III. Dover Publications, New York (1964)

    MATH  Google Scholar 

  5. Günter, N.M.: La theorie du potentiel et ses applications aux problemes fondamentaux de la physique mathematique. Gauthier-Villars, Paris (1934)

    Google Scholar 

  6. Jäckel, P.: Monte Carlo Methods in Finance. John Wiley & Sons, Chichester (2002)

    Google Scholar 

  7. Kantorovich, L.W., Krylov, V.I.: Approximate Methods of Higher Analysis. Interscience, New York (1964).

    Google Scholar 

  8. Mascagni, M., Karaivanova, A.: Matrix computations using quasirandom sequences. In: Vulkov, L.G., Waśniewski, J., Yalamov, P. (eds.) NAA 2000. LNCS, vol. 1988, pp. 552–559. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Mascagni, M., Karaivanova, A., Hwang, C.-O.: Quasi-Monte Carlo methods for elliptic boundary value problems. In: Proceedings of the 5th Int. Conf. on MCQMC, Singapore (November 2002) (submitted)

    Google Scholar 

  10. 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 

  11. Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo methods. SIAM, Philadelphia (1992)

    MATH  Google Scholar 

  12. Ogawa, S., Lecot, C.: A quasi-random walk method for one-dimensional reactiondiffusion equations. Math. Comput. Simulation 62(3-6), 487–494 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sabelfeld, K.K.: Vector algorithms of the Monte Carlo method for solving systems of 2-nd order elliptic equations and Lame equation. Doklady USSR Acad.Sci. 262, 1076–1080 (1982) (Russian)

    MathSciNet  Google Scholar 

  14. Sabelfeld, K.K.: Monte Carlo methods in boundary value problems. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  15. Sabelfeld, K.K., Simonov, N.A.: Random walks on boundary for solving PDEs. VSP, Utrecht, The Netherlands (1994)

    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

Karaivanova, A., Mascagni, M., Simonov, N.A. (2004). Solving BVPs Using Quasirandom Walks on the Boundary. 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_17

Download citation

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

  • 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