arXiv · 1710.10622
"Swarm relaxation": Equilibrating a large ensemble of computer simulations
Abstract
It is common practice in molecular dynamics and Monte Carlo computer simulations to run multiple, separately-initialized simulations in order to improve the sampling of independent microstates. Here we examine the utility of an extreme case of this strategy, in which we run a large ensemble of $M$ independent simulations (a "swarm"), each of which is relaxed to equilibrium. We show that if $M$ is of order $10^3$, we can monitor the swarm's relaxation to equilibrium, and confirm its attainment, within $\sim 10\barτ$, where $\barτ$ is the equilibrium relaxation time. As soon as a swarm of this size attains equilibrium, the ensemble of $M$ final microstates from each run is sufficient for the evaluation of most equilibrium properties without further sampling. This approach dramatically reduces the wall-clock time required, compared to a single long simulation, by a factor of several hundred, at the cost of an increase in the total computational effort by a small factor. It is also well-suited to modern computing systems having thousands of processors, and is a viable strategy for simulation studies that need to produce high-precision results in a minimum of wall-clock time. We present results obtained by applying this approach to several test cases.
Explore related subjects
Keep this discovery
Shahrazad M. A. Malek, Richard K. Bowles, Ivan Saika-Voivod, Francesco Sciortino, Peter H. Poole. 2017-10-29. "Swarm relaxation": Equilibrating a large ensemble of computer simulations. https://doi.org/10.1140/epje%2Fi2017-11588-2
Cite the original work for its findings. Save a collection to share your selection of sources.