Abstract
We consider Adaptively Restrained Langevin dynamics, in which the kinetic energy function vanishes for small velocities. Properly parameterized, this dynamics makes it possible to reduce the computational complexity of updating inter-particle forces, and to accelerate the computation of ergodic averages of molecular simulations. In this paper, we analyze the influence of the method parameters on the total achievable speed-up. In particular, we estimate both the algorithmic speed-up, resulting from incremental force updates, and the influence of the change of the dynamics on the asymptotic variance. This allows us to propose a practical strategy for the parameterization of the method. We validate these theoretical results by representative numerical experiments.
| Original language | English |
|---|---|
| Pages (from-to) | 412-428 |
| Number of pages | 17 |
| Journal | Journal of Computational Physics |
| Volume | 336 |
| DOIs | |
| Publication status | Published - 1 May 2017 |
Keywords
- Adaptive methods
- Computational complexity
- Ergodic averages
- Langevin dynamics
- Sampling efficiency
- Variance
Fingerprint
Dive into the research topics of 'Estimating the speed-up of adaptively restrained Langevin dynamics'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver