UNSPECIFIED. (2001) Algorithms for particle-field simulations with collisions. JOURNAL OF COMPUTATIONAL PHYSICS, 172 (2). pp. 766-807. ISSN 0021-9991

Full text not available from this repository.

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. (C) 2001 Academic Press.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QC Physics
Journal or Publication Title:	JOURNAL OF COMPUTATIONAL PHYSICS
Publisher:	ACADEMIC PRESS INC
ISSN:	0021-9991
Date:	20 September 2001
Volume:	172
Number:	2
Number of Pages:	42
Page Range:	pp. 766-807
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/11728

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item