Algorithms for Particle-Field Simulations with Collisions
Abstract
We develop an efficient algorithm for detecting collisions among a large number of particles moving in a velocity field, when the field itself is possibly coupled to the particle motions. We build on ideas from molecular dynamics simulations and, as a byproduct, give a literature survey of methods for hard sphere molecular dynamics. We analyze the complexity of the algorithm in detail and present several experimental results on performance which corroborate the analysis. An optimal algorithm for collision detection has cost scaling at least like the total number of collisions detected. We argue, both theoretically and experimentally, that with the appropriate parameter choice and when the number of collisions grows with the number of particles at least as fast as for billiards, the algorithm we recommend is optimal.
Additional Information
© 2001 Academic Press. Received 24 October 2000, Revised 26 June 2001. We thank Paul Tupper for reading early versions of the manuscript and providing numerous useful suggestions. We also thank an anonymous referee for helpful suggestions concerning our complexity analysis.Additional details
- Eprint ID
- 78077
- Resolver ID
- CaltechAUTHORS:20170612-063817274
- Created
-
2017-06-12Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field
- Other Numbering System Name
- Andrew Stuart
- Other Numbering System Identifier
- J48