An efficient chained-hash-table strategy for collision handling in hard-sphere discrete particle modeling

C. L. Wu*, A. S. Berrouk, K. Nandakumar

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

We develop an efficient algorithm for handling collision events that is suitable for Discrete Particle Modeling (DPM) of dense gas-solid fluidization systems. We improve on previous strategies that are discussed in this paper as a byproduct. The core idea is centered on the use of dynamic crosswise linked data structures. This type of data structures enables an efficient updating and managing of lists of collision events associated with particles. In addition, a chained-hash-table strategy is proposed to efficiently process particle collision sequences. For systems of Np particles, this strategy allows a complexity O(1) time per collision regarding the event list handling operations.

Original languageEnglish
Pages (from-to)58-67
Number of pages10
JournalPowder Technology
Volume197
Issue number1-2
DOIs
StatePublished - 10 Jan 2010
Externally publishedYes

Keywords

  • Collision
  • Gas-solid system
  • Hard-sphere discrete particle model
  • Numerical efficiency

Fingerprint

Dive into the research topics of 'An efficient chained-hash-table strategy for collision handling in hard-sphere discrete particle modeling'. Together they form a unique fingerprint.

Cite this