𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple algorithm for isothermal–isobaric molecular dynamics

✍ Scribed by Harry A. Stern


Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
185 KB
Volume
25
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis


We review principles of non-Hamiltonian statistical mechanics and present a new set of equations and integration algorithm for isothermal-isobaric dynamics. The chief advantage of the present scheme is that it is somewhat simpler than previous methods. We perform numerical simulations to test the accuracy of the algorithm and compare its stability to that of a "gold standard," a symplectic integrator for Hamiltonian dynamics of the same system. The stability of the isothermal-isobaric algorithm is comparable to the stability of the symplectic integrator.


📜 SIMILAR VOLUMES


Isothermal molecular dynamics calculatio
✍ L.V. Woodcock 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 478 KB

The molecular dynamics algorithm of Verlet is extended to study dense neukai assemblies of charged particles under specified.V-T conditions. Thermodynamic quantities are obtained for liquid alkali chkrides at 1273°K which are in satisfactory agreement with experiment.

Algorithms for clustering molecular dyna
✍ Andrew E. Torda; Wilfred F. van Gunsteren 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 805 KB

Two traditional clustering algorithms are applied to configurations from a long molecular dynamics trajectory and compared using two sets of test data. First, a subset of atoms was chosen to present conformations which naturally fall into a number of clusters. Second, a subset of atoms was selected

Dynamic load balancing algorithms for re
✍ William S. Young; Charles L. Brooks III 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 755 KB

Algorithms to enhance parallel performance of molecular dynamics simulations on parallel computers by dynamic load balancing are described. Load balancing is achieved by redistribution of work based on either a history of time spent computing per processor or on the number of pair interactions compu

An Optimized Algorithm for Molecular Dyn
✍ E. Glikman; I. Kelson; N.V. Doan; H. Tietze 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 272 KB

tasks, which results in considerable CPU time savings. This method is based on selectively limiting the calculation of A method of optimizing molecular dynamics calculations is presented. The method employs multiple time steps across the computhe forces and the neighbor list updating, according to t