Advanced Algorithms for Molecular Dynamics Simulation
Andreas Windemuth · ACS symposium series · 1995
A collection of algorithms is presented to allow for the efficient computation of the dynamics of large systems of macromolecules and solvent. Application of the Fast Multipole Algorithm coupled with the Distance Class Algorithm, a multiple timestep method, permits the evaluation of unlimited long-range interaction at a cost lower than that of conventional cutoff calculations. A new method for the calculation of analytical surface areas and derivatives, the Circle Intersection Method (CIM), is also described. The CIM is at least 2—3 times faster than existing exact analytic methods. All methods described in this paper are designed to be scalably parallel, meaning that resource requirements grow at most linearly with the size of the system and are inversely proportional to the number of processing nodes for sufficiently large systems. The experimental program PMD, designed to implement these methods, is described and plans for its future development with emphasis on advanced solvent modeling is outlined. PMD is made freely available at this point to provide a flexible testing ground for advanced algorithms to all interested researchers.
Cited by 16 works. doi:10.1021/bk-1995-0592.ch011