Algorithms for Particle-Field Simulations with Collisions

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 f...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of computational physics Jg. 172; H. 2; S. 766 - 807
Hauptverfasser:	Sigurgeirsson, Hersir, Stuart, Andrew, Wan, Wing-Lok
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 20.09.2001
Schlagworte:	collision detection algorithm complexity hard sphere molecular dynamics particle laden flow fluid suspension back-coupling
ISSN:	0021-9991, 1090-2716
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
Bibliographie:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0021-9991 1090-2716
DOI:	10.1006/jcph.2001.6858