GPU based discrete element modeling for convex polyhedral shape particles: Development and validation

Abstract

Particle dynamics simulations face a significant challenge in understanding the intricate behaviors of convex polyhedral particles due to their complex geometries and interactions. DEM emerges as a key method, illuminating the concealed intricacies of these geometric entities. Traditional algorithms often require cumbersome processes to check each type of contact individually. However, Gilbert–Johnson–Keerthi’s (GJK) and the expanding polytope algorithm (EPA) provide efficient numerical solutions for polyhedral contact detection and contact resolution. These Minkowski difference-based methods streamline contact detection and overlap computation, paving the way for deeper exploration of three-dimensional contact theory within DEM simulations. By leveraging GPU computational power, this paper outlines key algorithmic steps and verifies the solver’s accuracy through comparison with simulated and experimental data, with an average deviation of less than 5%. This study explores the impact of particle shape on the dynamics and mechanical behavior of densely packed systems, particularly in hoppers and tumblers. Spherical particles discharge faster but mix more slowly than polyhedral shapes, with icosahedrons achieving quicker full mixing. These results align with experimental findings, further validating the simulation approach.