### Abstract

A frequently encountered problem in molecular dynamics is how to treat the long times that are required to simulate condensed systems consisting of particles interacting through long range forces. Standard methods require the calculation of the forces at every time step. Because each particle interacts with all particles within the interaction range of the potential the longer the range of the potential the larger the number forces that must be calculated at each time step. In this note we present a variant of the RESPA (reference system propagator algorithm), which we developed for handling systems with multiple time scales like disparate mass mixtures. This version of RESPA greatly reduces the number of forces that must be computed at each time step and thereby leads to a dramatic acceleration of such simulations. The RESPA method uses ideas similar to NAPA, an algorithm we invented to treat high frequency oscillators interacting with low frequency bath. The method is based on a choice of a reference system in which the particles interact through short range forces. The reference system is numerically integrated for n time steps σt and the error incurred by using short range forces is corrected by solving a rigorous set of equations once every Δt=nσt. This method reduces the cpu time dramatically. It is shown that this approach and suitable generalizations should be very useful for future simulations of quantum and classical condensed matter systems.

Original language | English (US) |
---|---|

Pages (from-to) | 6811-6815 |

Number of pages | 5 |

Journal | The Journal of Chemical Physics |

Volume | 94 |

Issue number | 10 |

DOIs | |

State | Published - 1991 |

### ASJC Scopus subject areas

- Physics and Astronomy(all)
- Physical and Theoretical Chemistry

## Fingerprint Dive into the research topics of 'Molecular dynamics algorithm for multiple time scales: Systems with long range forces'. Together they form a unique fingerprint.

## Cite this

*The Journal of Chemical Physics*,

*94*(10), 6811-6815. https://doi.org/10.1063/1.460259