Year-end Sale % OFF 
Abstract
In this work we present a simple, fast technique for generating particle packs at high packing ratios aiming at the simulation of granular compacts via the discrete element method (DEM). We start from a random sequence addition particle generation algorithm to generate a layer of non-overlapping spherical particles that are let to evolve dynamically in time under the action of compacting or jamming pseudo forces. A layer-by-layer approach is then followed to generate multiple layers on top of each other. In the end, very dense packs with pre-defined bulk shapes and sizes (e.g. rectangles in two dimensions and prisms in three dimensions) are achieved. The influence of rolling motion (with particle rotation and spin) along with inter-particle friction on the density and ordering of the generated packs is assessed. Both congruent and inhomogeneous packs (with respect to particle sizes) are created and their packing properties evaluated. We believe that simple techniques for fast generation of particle packs at high packing ratios are essential tools for the DEM simulation of granular compacts.
Highlights
The study of particle packing and the development of particle packing algorithms have been topics of great interest among the computational physics and computational mechanics communities
Our technique has connections with the well-known, long-established Lubachevsky-Stillinger algorithm of Lubachevsky and Stillinger (1999), in the sense that a pseudo dynamics simulation of randomly generated particles is performed to squeeze the particles, but differs from it in that (i) we do not employ particle growth, (ii) we consider inter-particle friction with rolling motion in the dynamics, (iii) our pseudo jamming forces are of a different nature and (iv) we follow a layer-wise procedure
A stick-slip model could be considered, we find it unnecessary for the dynamics we are concerned with in this work
Summary
The study of particle (especially hard spheres) packing and the development of particle packing algorithms have been topics of great interest among the computational physics and computational mechanics communities. Our technique has connections with the well-known, long-established Lubachevsky-Stillinger algorithm of Lubachevsky and Stillinger (1999), in the sense that a pseudo dynamics simulation of randomly generated particles is performed to squeeze the particles, but differs from it in that (i) we do not employ particle growth ( congruent packs are made possible in a more natural, easier way), (ii) we consider inter-particle friction with rolling motion in the dynamics (this is possible since we adopt a DEM description instead of a molecular dynamics one), (iii) our pseudo jamming forces are of a different nature and (iv) we follow a layer-wise procedure In this latter aspect, our technique may be viewed as a variation of the procedure proposed by Jiang and coworkers in 2003.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
