𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel multiple-time-step molecular dynamics with three-body interaction

✍ Scribed by Aiichiro Nakano; Priya Vashishta; Rajiv K. Kalia


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
902 KB
Volume
77
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis


For particles interacting via two-and three-body potentials, a domain-decomposition algorithm is usi molecular dynamics (MD) on distributed memory MIMD (multiple-instruction multiple-data) computers employs the linked-cell-list method and separable three-body force calculation. The force calculation is ac multiple-time-step (MTS) method. For a 1.54 million particle Si0 2 system, the MD program runs at a ss teps per hour (1100 steps/h without the three-body interaction) on a 64-node Intel 1PSC/860. The pan highly efficient (parallel efficiency = 0.973), as it involves only 3% communication overhead. Utilizing the sΓ΅ f the potential energy, the conjugate-gradient search for a local minimum underlying an MD configuration a factor of 13.


πŸ“œ SIMILAR VOLUMES


A multiple time step algorithm compatibl
✍ Vincent KrΓ€utler; Philippe H. HΓΌnenberger πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 224 KB

## Abstract A new algorithm is introduced to perform the multiple time step integration of the equations of motion for a molecular system, based on the splitting of the nonbonded interactions into a series of distance classes. The interactions between particle pairs in successive classes are update

Computationally efficient canonical mole
✍ Kawata, Masaaki; Mikami, Masuhiro πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

An efficient implementation of the canonical molecular dynamics simulation using the reversible reference system propagator algorithm (r-RESPA) combined with the particle mesh Ewald method (PMEM) and with the macroscopic expansion of the fast multipole method (MEFMM) was examined. The performance of