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

C. L. Wu; A. S. Berrouk; K. Nandakumar

doi:10.1016/j.powtec.2009.08.018

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 journal › Article › peer-review

13 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 N_p particles, this strategy allows a complexity O(1) time per collision regarding the event list handling operations.

Original language	English
Pages (from-to)	58-67
Number of pages	10
Journal	Powder Technology
Volume	197
Issue number	1-2
DOIs	https://doi.org/10.1016/j.powtec.2009.08.018
State	Published - 10 Jan 2010
Externally published	Yes

Keywords

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

Access to Document

10.1016/j.powtec.2009.08.018

Cite this

@article{3ce50bb2e987458aa80dd4bc76313ad3,

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

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

keywords = "Collision, Gas-solid system, Hard-sphere discrete particle model, Numerical efficiency",

author = "Wu, {C. L.} and Berrouk, {A. S.} and K. Nandakumar",

note = "Funding Information: This work was partly supported by a grant from the Guangdong Natural Science Foundation. ",

year = "2010",

month = jan,

day = "10",

doi = "10.1016/j.powtec.2009.08.018",

language = "英语",

volume = "197",

pages = "58--67",

journal = "Powder Technology",

issn = "0032-5910",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

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

AU - Wu, C. L.

AU - Berrouk, A. S.

AU - Nandakumar, K.

N1 - Funding Information: This work was partly supported by a grant from the Guangdong Natural Science Foundation.

PY - 2010/1/10

Y1 - 2010/1/10

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

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

KW - Collision

KW - Gas-solid system

KW - Hard-sphere discrete particle model

KW - Numerical efficiency

UR - http://www.scopus.com/inward/record.url?scp=70350072313&partnerID=8YFLogxK

U2 - 10.1016/j.powtec.2009.08.018

DO - 10.1016/j.powtec.2009.08.018

M3 - 文章

AN - SCOPUS:70350072313

SN - 0032-5910

VL - 197

SP - 58

EP - 67

JO - Powder Technology

JF - Powder Technology

IS - 1-2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this