Skip to main content

Parallel Realization of Grid-Free Monte Carlo Algorithm for Boundary Value Problems

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

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

Included in the following conference series:

  • 1829 Accesses

Abstract

In many areas of the science there is a need to evaluate a functional of the solution of a given problem directly without computing the solution itself. The problem here is a linear functional of the solution of an elliptic boundary value problem to be estimated. Such kind of problems are similar to the air pollution problems in environmental sciences, where a rough estimate of the solution is acceptable. For practical computations it means that the relative error is about 5% – 10%. To solve this problem a grid–free Monte Carlo (MC) algorithm is used. The algorithm makes use of a Monte Carlo procedure called “Walk on the balls”. Here we consider parallel realizations of the considered grid–free MC algorithm. Various numerical results are obtained by the implementation of the proposed parallel algorithms on several high performance machines: IBM +p690 Regata system and Sun Fire 15K server. One can see that the efficiency of the proposed parallel algorithm is close to 100%.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bitzadze, A.V.: Equations of the Mathematical Physics. Nauka, Moscow (1982)

    Google Scholar 

  2. Dimov, I., Gurov, T.: 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 

  3. Elepov, B.S., Kronberg, A.A., Mikhailov, G.A., Sabelfeld, K.K.: Solving the Boundary Value Problems by the Monte Carlo method. Nauka, Novosibirsk (1980)

    Google Scholar 

  4. Ermakov, S.M., Mikhailov, G.A.: Statistical Simulation. Nauka, Moscow (1982)

    MATH  Google Scholar 

  5. Ermakov, S.M., Nekrutkin, V.V., Sipin, A.S.: Random Processes for Solving Classical Equations of the Mathematical Physics. Nauka, Moscow (1984)

    Google Scholar 

  6. Gurov, T.V., Whitlock, P.A., Dimov, I.T.: A grid free monte carlo algorithm for solving elliptic boundary value problems. In: Vulkov, L.G., Waśniewski, J., Yalamov, P. (eds.) NAA 2000. LNCS, vol. 1988, pp. 359–367. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Google Scholar 

  8. Miranda, C.: Partial Differential Equations of Elliptic Type. Springer, Heidelberg (1970)

    MATH  Google Scholar 

  9. Muller, M.: Some continuous Monte Carlo methods for the Dirichlet problem. Ann Math. Stat. 27(3), 569–589 (1956)

    Article  MATH  Google Scholar 

  10. Papancheva, R.Y., Dimov, I.T., Gurov, T.V.: A New class of grid–free Monte Carlo Algorithms for Elliptic Boundary Value Problems. In: Dimov, I.T., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 132–139. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Papancheva, R.Y., Gurov, T.V., Dimov, I.T.: Monte Carlo study of particle transport problem in Air Pollution. Pliska Studia Mathematica Bulgarica 14, 107–116 (2003)

    MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  13. SPRNG: Scalable Parallel Random Number Generator, http://sprng.cs.fsu.edu/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papancheva, R.Y. (2006). Parallel Realization of Grid-Free Monte Carlo Algorithm for Boundary Value Problems. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_19

Download citation

  • DOI: https://doi.org/10.1007/11666806_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31994-8

  • Online ISBN: 978-3-540-31995-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics