Accelerating molecular dynamics simulations with population annealing
arXiv:1806.06016 · doi:10.1103/PhysRevLett.122.060602
Abstract
Population annealing is a powerful tool for large-scale Monte Carlo simulations. We adapt this method to molecular dynamics simulations and demonstrate its excellent accelerating effect by simulating the folding of a short peptide commonly used to gauge the performance of algorithms. The method is compared to the well established parallel tempering approach and is found to yield similar performance for the same computational resources. In contrast to other methods, however, population annealing scales to a nearly arbitrary number of parallel processors and it is thus a unique tool that enables molecular dynamics to tap into the massively parallel computing power available in supercomputers that is so much needed for a range of difficult computational problems.
References in corpus (12)
- Escaping free-energy minima
- An efficient, multiple range random walk algorithm to calculate the density of states
- Exchange Monte Carlo Method and Application to Spin Glass Simulations
- Multicanonical Ensemble: A New Approach to Simulate First-order Phase Transitions
- Parallel Tempering Algorithm for Conformational Studies of Biological Molecules
- Population Annealing with Weighted Averages: A Monte Carlo Method for Rough Free Energy Landscapes
- Go with the Winners: a General Monte Carlo Strategy
- Population Monte Carlo algorithms
- Population annealing: Theory and application in spin glasses
- GPU accelerated population annealing algorithm
- Population Annealing Simulations of a Binary Hard Sphere Mixture
- Exploring first-order phase transitions with population annealing
Cited by in corpus (5)
- Understanding population annealing Monte Carlo simulations
- Weighted averages in population annealing: analysis and general framework
- Monte Carlo Simulation of Long Hard-Sphere Polymer Chains in Two to Five Dimensions
- Algorithm for the replica redistribution in the implementation of parallel annealing method on the hybrid supercomputer architecture
- Frustrated Ising model on the honeycomb lattice: Metastability and universality