Generalized Verlet algorithm for efficient molecular dynamics simulations with 
long-range interactions.

Grubmüller, H.; Heller, H.; Windemuth, A.; Schulten, K.

doi:10.1080/08927029108022142

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Generalized Verlet algorithm for efficient molecular dynamics simulations with long-range interactions.

MPS-Authors

/persons/resource/persons15155

Grubmüller, H.
Department of Theoretical and Computational Biophysics, MPI for biophysical chemistry, Max Planck Society;

External Resource

http://www.tandfonline.com/doi/pdf/10.1080/08927029108022142
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

1836597.pdf
(Publisher version), 2MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Grubmüller, H., Heller, H., Windemuth, A., & Schulten, K. (1991). Generalized Verlet algorithm for efficient molecular dynamics simulations with long-range interactions. Molecular Simulation, 6(1-3), 121-142. doi:10.1080/08927029108022142.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-5506-5

Abstract

For the purpose of molecular dynamics simulations of large biopolymers we have developed a new method to accelerate the calculation of long-range pair interactions (e.g. Coulomb interaction). The algorithm introduces distance classes to schedule updates of non-bonding interactions and to avoid unnecessary computations of interactions between particles which are far apart. To minimize the error caused by the updating schedule, the Verlet integration scheme has been modified. The results of the method are compared to those of other approximation schemes as well as to results obtained by numerical integration without approximation. For simulation of a protein with 12 637 atoms our approximation scheme yields a reduction of computer time by a factor of seven. The approximation suggested can be implemented on sequential as well as on parallel computers. We describe an implementation on a (Transputer-based) MIMD machine with a systolic ring architecture.