1993
DOI: 10.1021/ci00012a011
|View full text |Cite
|
Sign up to set email alerts
|

Implicit Runge-Kutta method for molecular dynamics integration

Abstract: An implicit Runge-Kutta (RK) integration scheme, the two-stage 4th order Gauss-Legendre Runge-Kutta (GLRK) method, for numerical solution of molecular dynamics equations is described. An estimate of the initial guess for the starting value of the fixed-point iteration is based on the typical particle frequency. The algorithm was applied to the harmonic oscillator and compared to various algorithms for numerical integration of equations of motion. The algorithm was also applied to a complex system of 256 partic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

1994
1994
2020
2020

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 29 publications
(12 citation statements)
references
References 1 publication
0
12
0
Order By: Relevance
“…In this regard, some classical force fields, for instance, CHARMM, OPLS and COMPASS, have been developed by empirically fitting quantum mechanics results to address different application scenarios. Although the calculation principle of MD simulations seems straightforward according to the above explanations, the practical performance still needs some advanced algorithms to enable the accuracy and efficiency during the solution process, such as leapfrog, Verlet, Gear predictor-corrector, and Runge–Kutta algorithms. Considering that there are a few professional software (code) programs to implement the MD simulations, hereby, the details of MD simulations theory and method are not discussed deeply, which can be referenced by the previous literature or help manuals of software (code): LAMMPS, Gromacs, and NAMD .…”
Section: Molecular Dynamics (Md) Simulationsmentioning
confidence: 99%
“…In this regard, some classical force fields, for instance, CHARMM, OPLS and COMPASS, have been developed by empirically fitting quantum mechanics results to address different application scenarios. Although the calculation principle of MD simulations seems straightforward according to the above explanations, the practical performance still needs some advanced algorithms to enable the accuracy and efficiency during the solution process, such as leapfrog, Verlet, Gear predictor-corrector, and Runge–Kutta algorithms. Considering that there are a few professional software (code) programs to implement the MD simulations, hereby, the details of MD simulations theory and method are not discussed deeply, which can be referenced by the previous literature or help manuals of software (code): LAMMPS, Gromacs, and NAMD .…”
Section: Molecular Dynamics (Md) Simulationsmentioning
confidence: 99%
“…The problem of how to increase the time step in MD simulations can be overcome by use of symplectic methods. …”
Section: Introductionmentioning
confidence: 99%
“…For example, standard high-stability implicit schemes for stiff differential equations, such as implicitEuler (IE) (43,73,95) and implicit-midpoint (IM) (57), are unsatisfactory for proteins and nucleic acids at atomic resolution at large timesteps because of numerical damping (69,96,119) and resonance (57) problems, respectively. Implicit methods are also computationally expensive since solution of a nonlinear system is required at each timestep (48,49,120,121). Algorithms based on substructuring (110) require substantial tailoring and perhaps relaxation of goals (i.e.…”
Section: Strong Vibrational Coupling In Biomoleculesmentioning
confidence: 99%
“…Implicit methods are also costly because of the nonlinear minimization or linear-system subproblem at each timestep (121), and they are not likely to be competitive in general. Janežič and coworkers reported such substantial increases in complexity with their implicit symplectic RungeKutta integrator (48), even with an efficient solution process for the resulting nonlinear system. They subsequently sought greater efficiency in parallel implementations (49) [see (55) for comments].…”
Section: Implicit Schemesmentioning
confidence: 99%