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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of computational physics Ročník 172; číslo 2; s. 766 - 807
Hlavní autoři:	Sigurgeirsson, Hersir, Stuart, Andrew, Wan, Wing-Lok
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 20.09.2001
Témata:	collision detection algorithm complexity hard sphere molecular dynamics particle laden flow fluid suspension back-coupling
ISSN:	0021-9991, 1090-2716
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
Bibliografie:	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