Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10356467 | Journal of Computational Physics | 2005 | 29 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Aleksandar Donev, Salvatore Torquato, Frank H. Stillinger,