pith. sign in

arxiv: math/0703407 · v1 · pith:Q3PR4LGVnew · submitted 2007-03-14 · 🧮 math.NA · cs.NA

Diffusion Monte Carlo method: numerical analysis in a simple case

classification 🧮 math.NA cs.NA
keywords methodnumberwalkerscarloconvergencediffusionfixedmonte
0
0 comments X
read the original abstract

The Diffusion Monte Carlo method is devoted to the computation of electronic ground-state energies of molecules. In this paper, we focus on implementations of this method which consist in exploring the configuration space with a {\bf fixed} number of random walkers evolving according to a Stochastic Differential Equation discretized in time. We allow stochastic reconfigurations of the walkers to reduce the discrepancy between the weights that they carry. On a simple one-dimensional example, we prove the convergence of the method for a fixed number of reconfigurations when the number of walkers tends to $+\infty$ while the timestep tends to 0. We confirm our theoretical rates of convergence by numerical experiments. Various resampling algorithms are investigated, both theoretically and numerically

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.