✦ LIBER ✦

Algorithms for Particle-Field Simulations with Collisions

✍ Scribed by Hersir Sigurgeirsson; Andrew Stuart; Wing-Lok Wan

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 477 KB
Volume: 172
Category: Article
ISSN: 0021-9991
DOI: 10.1006/jcph.2001.6858

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A Fast Algorithm for Particle Simulation

A Fast Algorithm for Particle Simulations

✍ L. Greengard; V. Rokhlin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 407 KB

We restrict our attention in this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potenti

A binary collision model for plasma simu

A binary collision model for plasma simulation with a particle code

✍ Tomonor Takizuka; Hirotada Abe 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Defining and optimizing algorithms for n

Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations

✍ G. Viccione; V. Bovolin; E. Pugliese Carratelli 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

Parallel Transient Dynamics Simulations:

Parallel Transient Dynamics Simulations: Algorithms for Contact Detection and Smoothed Particle Hydrodynamics

✍ Steve Plimpton; Steve Attaway; Bruce Hendrickson; Jeff Swegle; Courtenay Vaughan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 625 KB

Transient dynamics simulations are commonly used to model phenomena such as car crashes, underwater explosions, and the response of shipping containers to high-speed impacts. Physical objects in such a simulation are typically represented by Lagrangian meshes because the meshes can move and deform w

Introduction to “A Fast Algorithm for Pa

Introduction to “A Fast Algorithm for Particle Simulations”

✍ John A. Board Jr. 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 113 KB

tions of all of these methods are certainly possible, ## Department of Electrical and Computer Engineering Greengard and Bill Gropp pointed out early on the suitabil-Duke University ity of the FMA for parallel processing [3].

A Multiple-Heaps Algorithm for Parallel

A Multiple-Heaps Algorithm for Parallel Simulation of Collision Systems

✍ Mo Mu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 144 KB

We consider the parallel simulation of collision systems. It has wide application, such as in hard-sphere molecular dynamics simulation for gas dynamics and crystals, as well as in studying molecular collision dynamics of chemical reactions. With detailed analysis, proper data structures are designe