ε-Shell error analysis for "Walk On Spheres" algorithms

Authors:
Michael Mascagni;Chi-Ok Hwang
Affiliations:
Department of Computer Science, Florida State University, 203 Love Building Tallahassee, FL;Innovative Technology Center for Radiation Safety, Hanyang University, HIT Building, 17 Haengdang-Dong, Sungdong-Gu, Seoul 133-791, South Korea
Venue:
Mathematics and Computers in Simulation
Year:
2003

Citing 3
Cited 3

A Monte Carlo method for Poisson's equation

Journal of Computational Physics
The simulation-tabulation method for classical diffusion Monte Carlo

Journal of Computational Physics
Continuous Path Brownian Trajectories for Diffusion Monte Carlo via First- and Last-Passage Distributions

LSSC '01 Proceedings of the Third International Conference on Large-Scale Scientific Computing-Revised Papers

A Feynman-Kac path-integral implementation for Poisson's equation using an h-conditioned Green's function

Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001
Analysis and comparison of Green's function first-passage algorithms with "walk on spheres" algorithms

Mathematics and Computers in Simulation
Review: Monte Carlo methods for computing the capacitance of the unit cube

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The "Walk On Spheres" (WOS) algorithm and its relatives have long been used to solve a wide variety of boundary value problems [Ann. Math. Stat. 27 (1956) 569; J. Heat Transfer 89 (1967) 121; J. Chem. Phys. 100 (1994) 3821; J. Appl. Phys. 71 (1992) 2727]. All WOS algorithms that require the construction of random walks that terminate, employ an ε-shell to ensure their termination in a finite number of steps. To remove the error related to this ε-shell, Green's function first-passage (GFFP) algorithms have been proposed [J. Chem. Phys. 106 (1997) 3721] and used in several applications [Phys. Fluids A 12 (2000) 1699; Monte Carlo Meth. Appl. 7 (2001) 213; The simulation-tabulation method for classical diffusion Monte Carlo, J. Comput. Phys. submitted]. One way to think of the GFFP algorithm is as an ε = 0 extension of WOS. Thus, an important open question in the use of GFFP is to understand the tradeoff made in the efficiency of GFFP versus the ε-dependent error in WOS. In this paper, we present empirical evidence and analytic analysis of the ε-shell error in some simple boundary value problems for the Laplace and Poisson equations and show that the error associated with the ε-shell is O(ε), for small ε. This fact supports the conclusion that GFFP is preferable to WOS in cases where both are applicable.