The Complexity of Parallel Symplectic Molecular Dynamics Algorithms
- 1 November 1997
- journal article
- research article
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Computer Sciences
- Vol. 37 (6) , 1055-1062
- https://doi.org/10.1021/ci970226u
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Split Integration Symplectic Method for Molecular Dynamics IntegrationJournal of Chemical Information and Computer Sciences, 1997
- BIOMOLECULAR DYNAMICS AT LONG TIMESTEPS:Bridging the Timescale Gap Between Simulation and ExperimentationAnnual Review of Biophysics, 1997
- An Efficient Symplectic Integration Algorithm for Molecular Dynamics SimulationsJournal of Chemical Information and Computer Sciences, 1995
- Comparison of Parallel Verlet and Implicit Runge-Kutta Methods for Molecular Dynamics IntegrationJournal of Chemical Information and Computer Sciences, 1995
- Improvement of methods for molecular dynamics integrationInternational Journal of Quantum Chemistry, 1994
- New spherical‐cutoff methods for long‐range forces in macromolecular simulationJournal of Computational Chemistry, 1994
- Parallelization of an Implicit Runge-Kutta Method for Molecular Dynamics IntegrationJournal of Chemical Information and Computer Sciences, 1994
- Dynamics of molecules with internal degrees of freedom by multiple time-step methodsThe Journal of Chemical Physics, 1993
- Implicit Runge-Kutta method for molecular dynamics integrationJournal of Chemical Information and Computer Sciences, 1993
- An analysis of the accuracy of Langevin and molecular dynamics algorithmsMolecular Physics, 1988