TY - JOUR
T1 - Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles
AU - Donev, Aleksandar
AU - Torquato, Salvatore
AU - Stillinger, Frank H.
N1 - Funding Information:
A.D. would like to thank H. Sigurgeirsson for his help with implementing the EDMD event loop, L.F. Shampine and I. Gladwell for their advice concerning event location in ODEs, and the freeglut library team for their help with visualization, as well as many others who have contributed public domain codes used in this project. The authors were supported in part by the Petroleum Research Fund under Grant No. 36967-AC9, and by the National Science Foundation under Grant Nos. DMR-0213706 and DMS-0312067.
PY - 2005/1/20
Y1 - 2005/1/20
N2 - We apply the algorithm presented in the first part of this series of papers to systems of hard ellipses and ellipsoids. The theoretical machinery needed to treat such particles, including the overlap potentials, is developed in full detail. We describe an algorithm for predicting the time of collision for two moving ellipses or ellipsoids. We present performance results for our implementation of the algorithm, demonstrating that for dense systems of very aspherical ellipsoids the novel techniques of using neighbor lists and bounding sphere complexes, offer as much as two orders of magnitude improvement in efficiency over direct adaptations of traditional event-driven molecular dynamics algorithms. The practical utility of the algorithm is demonstrated by presenting several interesting physical applications, including the generation of jammed packings inside spherical containers, the study of contact force chains in jammed packings, and melting the densest-known equilibrium crystals of prolate spheroids.
AB - We apply the algorithm presented in the first part of this series of papers to systems of hard ellipses and ellipsoids. The theoretical machinery needed to treat such particles, including the overlap potentials, is developed in full detail. We describe an algorithm for predicting the time of collision for two moving ellipses or ellipsoids. We present performance results for our implementation of the algorithm, demonstrating that for dense systems of very aspherical ellipsoids the novel techniques of using neighbor lists and bounding sphere complexes, offer as much as two orders of magnitude improvement in efficiency over direct adaptations of traditional event-driven molecular dynamics algorithms. The practical utility of the algorithm is demonstrated by presenting several interesting physical applications, including the generation of jammed packings inside spherical containers, the study of contact force chains in jammed packings, and melting the densest-known equilibrium crystals of prolate spheroids.
UR - http://www.scopus.com/inward/record.url?scp=10244259129&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=10244259129&partnerID=8YFLogxK
U2 - 10.1016/j.jcp.2004.08.025
DO - 10.1016/j.jcp.2004.08.025
M3 - Article
AN - SCOPUS:10244259129
SN - 0021-9991
VL - 202
SP - 765
EP - 793
JO - Journal of Computational Physics
JF - Journal of Computational Physics
IS - 2
ER -