English

"Swarm relaxation": Equilibrating a large ensemble of computer simulations

Statistical Mechanics 2017-11-20 v1

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 MM independent simulations (a "swarm"), each of which is relaxed to equilibrium. We show that if MM is of order 10310^3, we can monitor the swarm's relaxation to equilibrium, and confirm its attainment, within 10τˉ\sim 10\bar\tau, where τˉ\bar\tau is the equilibrium relaxation time. As soon as a swarm of this size attains equilibrium, the ensemble of MM 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.

Keywords

Cite

@article{arxiv.1710.10622,
  title  = {"Swarm relaxation": Equilibrating a large ensemble of computer simulations},
  author = {Shahrazad M. A. Malek and Richard K. Bowles and Ivan Saika-Voivod and Francesco Sciortino and Peter H. Poole},
  journal= {arXiv preprint arXiv:1710.10622},
  year   = {2017}
}

Comments

12 pages. To appear in Eur. Phy. J. E, 2017

R2 v1 2026-06-22T22:28:53.118Z