Journal
POWDER TECHNOLOGY
Volume 245, Issue -, Pages 28-34Publisher
ELSEVIER
DOI: 10.1016/j.powtec.2013.04.009
Keywords
Random packing; Spheres; Polydisperse; Optimization
Categories
Funding
- European Community [214015]
Ask authors/readers for more resources
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures of such populations. We show that the results compare well to two much slower algorithms for directly simulating spheres in three dimensions, and show that the algorithm is fast enough to tackle inverse problems in particle packing: designing size distributions to meet required criteria. The one-dimensional method used in this paper is implemented as a computer code in the C programming language, available at http://sourceforge.net/projects/spherepack1/ under the terms of the GNU general public licence (version 2). (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available