Leapfrog Rotational Algorithms for Linear Molecules
- 1 September 1993
- journal article
- research article
- Published by Taylor & Francis in Molecular Simulation
- Vol. 11 (1) , 79-89
- https://doi.org/10.1080/08927029308022178
Abstract
A study is made of four algorithms which integrate the rotational equations of motion for rigid linear molecules. They are leapfrog algorithms in the sense that the quantities saved between time steps are the on-step orientation and the mid-step angular velocity. Thermostatted versions of the algorithms as well as conventional energy-conserving versions are described. The algorithms are extensively tested in simulations of liquid nitrogen, the aim being to study the effect of increased time steps on a range of measured properties. The most successful algorithm, based on applying a lenght constraint to the axis vector, shows remarkable stability and can be used with very large time steps.Keywords
This publication has 6 references indexed in Scilit:
- Leapfrog Rotational AlgorithmsMolecular Simulation, 1992
- Evaluation of temperature in molecular dynamics simulationComputer Physics Communications, 1990
- Choice of timestep in molecular dynamics simulationComputer Physics Communications, 1986
- Computer simulation of molecular liquid mixtures. I. A diatomic Lennard-Jones model mixture for CO2/C2H6The Journal of Chemical Physics, 1986
- Molecular dynamics with coupling to an external bathThe Journal of Chemical Physics, 1984
- Test of the Monte Carlo Method: Fast Simulation of a Small Ising LatticeThe Journal of Chemical Physics, 1970