Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Walking on Spheres and Talking to Neighbors: Variance Reduction for Laplace's Equation (2404.17692v2)

Published 26 Apr 2024 in physics.comp-ph, math.PR, and physics.app-ph

Abstract: Walk on Spheres algorithms leverage properties of Brownian Motion to create Monte Carlo estimates of solutions to a class of elliptic partial differential equations. We propose a new caching strategy which leverages the continuity of paths of Brownian Motion. In the case of Laplace's equation with Dirichlet boundary conditions, our algorithm has improved asymptotic runtime compared to previous approaches. Until recently, estimates were constructed pointwise and did not use the relationship between solutions at nearby points within a domain. Instead, our results are achieved by passing information from a cache of fixed size. We also provide bounds on the performance of our algorithm and demonstrate its performance on example problems of increasing complexity.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  1. The rate of convergence of the walk on spheres algorithm. Geometric and Functional Analysis, 22(3):558–587, 2012.
  2. Metrics for performance quantification of adaptive mesh refinement. Journal of Scientific Computing, 87(1):36, Mar 2021.
  3. Mean value caching for walk on spheres. 2023.
  4. Ferrite.jl.
  5. Code supporting “Walking on Spheres and Talking to Neighbors: Variance Reduction for Laplace’s Equation”, 2024.
  6. Vasek Chvatal. A greedy heuristic for the set-covering problem. Mathematics of operations research, 4(3):233–235, 1979.
  7. Richard Courant. Methods of Mathematical Physics: Partial Differential Equations, volume II. Wiley-VCH Verlag GmbH & Co., 1962.
  8. A random walk on rectangles algorithm. Methodology and Computing in Applied Probability, 8:135–151, 2006.
  9. Robert P Dobrow. Introduction to stochastic processes with R. John Wiley & Sons, 2016.
  10. Richard Durrett. Probability: Theory and examples. Thomson, 2005.
  11. The ultraspherical spectral element method. Journal of Computational Physics, 436:110087, 2021.
  12. Off-centered “walk-on-spheres”(wos) algorithm. Journal of Computational Physics, 303:331–335, 2015.
  13. Shizuo Kakutani. Two-dimensional brownian motion and harmonic functions. Proceedings of the Imperial Academy, 20(10):706–714, 1944.
  14. Efficient multi-level hp-finite elements in arbitrary dimensions. Computer Methods in Applied Mechanics and Engineering, 401:115575, 2022.
  15. Jean-François Le Gall. Brownian motion, martingales, and stochastic calculus. Springer, 2016.
  16. Grigorii Noikhovich Milstein. Numerical integration of stochastic differential equations, volume 313. Springer Science & Business Media, 1994.
  17. Boundary value caching for walk on spheres. arXiv preprint arXiv:2302.11825, 2023.
  18. Mervin E Muller. Some continuous monte carlo methods for the dirichlet problem. The Annals of Mathematical Statistics, pages 569–589, 1956.
  19. Monte carlo geometry processing: A grid-free approach to pde-based methods on volumetric domains. ACM Transactions on Graphics, 39(4), 2020.
  20. Grid-free monte carlo for pdes with spatially varying coefficients. ACM Transactions on Graphics (TOG), 41(4):1–17, 2022.
  21. Robust variance reduction for random walk methods. SIAM Journal on Scientific Computing, 25(6):1964–1981, 2004.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com