Random particle packing with large particle size variations using reduced-dimension algorithms
| dc.creator | Webb, M. D. | |
| dc.creator | Davis, I. L. | |
| dc.date | 2006-06-09 | |
| dc.date.accessioned | 2026-07-07T07:12:34Z | |
| dc.date.available | 2026-07-07T07:12:34Z | |
| dc.description | We present a reduced-dimension, ballistic deposition, Monte Carlo particle packing algorithm and discuss its application to the analysis of the microstructure of hard-sphere systems with broad particle size distributions. We extend our earlier approach (the ``central string'' algorithm) to a reduced-dimension, quasi-3D approach. Our results for monomodal hard-sphere packs exhibit a calculated packing fraction that is slightly less than the generally accepted value for a maximally random jammed state. The pair distribution functions obtained from simulations of composite structures with large particle size differences demonstrate that the algorithm provides information heretofore not attainable with existing simulation methods, and yields detailed understanding of the microstructure of these composite systems. | |
| dc.description | Accepted for publication in Powder Technology | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0606249 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0606249 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/112117 | |
| dc.subject | Materials Science | |
| dc.title | Random particle packing with large particle size variations using reduced-dimension algorithms | |
| dc.type | text |