Particle collision handling for hardsphere discrete particle model

The Discrete Particle Model (DPM) has been extensively used over the last decade tostudy the complicated flow behaviors in dense gas-solid fluidization systems relevant to awide range of chemical and petrochemical processes. Numerical simulations of thesereal-life systems involve often tracking a large number of particles colliding at highfrequency which results in a heavy computational burden. Thus, designing efficientcollision-handling algorithms to operate collision events is paramount for its industrialuse in studying flow dynamics in chemical reactors.In this chapter we first discuss previous algorithms developed for that purpose andthen present a novel, more efficient algorithm designed to handle collision events in thecontext of the hard-sphere DPM. The core idea is centered on the use of dynamiccrosswise linked data structures. This type of data structures enables an efficient updatingand managing of lists of collision events associated with particles. In addition, a chainedhash table strategy is proposed to efficiently process particle collision sequence. Forsystems of N particles, this strategy allows a complexity O(1) time per collision regardingthe event list handling operations.