A novel algorithm for non-bonded-list updating in molecular simulations.
Simulations of molecular systems typically handle interactions within non-bonded pairs. Generating and updating a list of these pairs can be the most time-consuming part of energy calculations for large systems. Thus, efficient non-bonded list processing can speed up the energy calculations significantly. While the asymptotic complexity of current algorithms (namely O(N), where N is the number of particles) is probably the lowest possible, a wide space for optimization is still left. This article offers a heuristic extension to the previously suggested grid based algorithms. We show that, when the average particle movements are slow, simulation time can be reduced considerably. The proposed algorithm has been implemented in the DistanceMatrix class of the molecular modeling package MESHI. MESHI is freely available at <www.cs.bgu.ac.il/~meshi>.
Maximova
Tatiana
T
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel.
Keasar
Chen
C
D000465:Algorithms; D003198:Computer Simulation; D008956:Models, Chemical; D013816:Thermodynamics