Quantum chemistry by random walk: A faster algorithm
James B. Anderson
Abstract
Abstract This little paper describes two procedures for achieving higher speeds in fixed-node diffusion QMC calculations with importance sampling. The first is an iterative procedure for reducing timestep error, thereby allowing larger and fewer time steps to obtain a given accuracy. The movement of a walker is divided into two parts: a diffusion step selected at random from an appropriate distribution and a drift step calculated from the drift velocity at the initial location. These give a temporary step to a new location for which the drift velocity is again determined. The average of the two velocities together with the original diffusion step is used to determine a permanent step. In tests, the procedure was found to reduce time-step error by a factor of 5 to 10. The second procedure makes use of two trial functions for importance sampling, the first a simple function for walker motion and the second a more complex and more accurate function for determining energies. These allow the more computationally expensive function to be used at large intervals for samples having a lower serial correlation.