Random particle packing with large particle size variations using reduced-dimension algorithms

Details Random particle packing with large particle size variations using reduced-dimension algorithms Random particle packing with large particle size variations using reduced-dimension algorithms

2006-06-09

arxiv.org/abs/cond-mat/0606249v1

Physics

Condensed Matter

Materials Science

Accepted for publication in Powder Technology

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Random particle packing with large particle size variations using reduced-dimension algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random particle packing with large particle size variations using reduced-dimension algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random particle packing with large particle size variations using reduced-dimension algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-409642