A Leap-frog Algorithm for Stochastic Dynamics
Wilfred F. van Gunsteren, H. J. C. Berendsen · Molecular Simulation · 1988
A third-order algorithm for stochastic dynamics (SD) simulations is proposed, identical to the powerful molecular dynamics leap-frog algorithm in the limit of infinitely small friction coefficient γ. It belongs to the class of SD algorithms, in which the integration time step Δt is not limited by the condition Δt ≤ γ−1, but only by the properties of the systematic force. It is shown how constraints, such as bond length or bond angle constraints, can be incorporated in the computational scheme. It is argued that the third-order Verlet-type SD algorithm proposed earlier may be simplified without loosing its third-order accuracy. The leap-frog SD algorithm is proven to be equivalent to the verlet-type SD algorithm. Both these SD algorithms are slightly more economical on computer storage than the Beeman-type SD algorithm.
Cited by 1,469 works. doi:10.1080/08927028808080941
Authors
References
- Probability, Random Variables, and Stochastic Processes.
- Probability, Random Variables, and Stochastic Processes
- Computer "Experiments" on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones Molecules
- Numerical integration of the cartesian equations of motion of a system with constraints: molecular dynamics of n-alkanes
- Computer Simulation Using Particles
- The fluctuation-dissipation theorem
- Algorithms for macromolecular dynamics and constraint dynamics
- PROCEEDINGS OF THE INTERNATIONAL SCHOOL OF PHYSICS ≪ENRICO FERMI≫
- Some multistep methods for use in molecular dynamics calculations
- Algorithms for brownian dynamics