2014
DOI: 10.1039/c3sm52959b
|View full text |Cite
|
Sign up to set email alerts
|

Random-close packing limits for monodisperse and polydisperse hard spheres

Abstract: We investigate how the densities of inherent structures, which we refer to as the closest jammed configurations, are distributed for packings of 10(4) frictionless hard spheres. A computational algorithm is introduced to generate closest jammed configurations and determine corresponding densities. Closest jamming densities for monodisperse packings generated with high compression rates using Lubachevsky-Stillinger and force-biased algorithms are distributed in a narrow density range from φ = 0.634-0.636 to φ≈ … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
126
1

Year Published

2015
2015
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 172 publications
(132 citation statements)
references
References 64 publications
5
126
1
Order By: Relevance
“…This subject has been investigated by many authors. [12][13][14][15][16][17][18] Two main group of techniques are based on the so-called random sequential addition process, 19 or on the Lubachevsky-Stillinger compression algorithm. 20 The technique applied in this paper is similar to the Lubachevsky-Stillinger algorithm which was originally proposed for two-dimensional discs.…”
Section: Introductionmentioning
confidence: 99%
“…This subject has been investigated by many authors. [12][13][14][15][16][17][18] Two main group of techniques are based on the so-called random sequential addition process, 19 or on the Lubachevsky-Stillinger compression algorithm. 20 The technique applied in this paper is similar to the Lubachevsky-Stillinger algorithm which was originally proposed for two-dimensional discs.…”
Section: Introductionmentioning
confidence: 99%
“…In figure 5 this boundary is indicated by a solid magenta line. The pressure of a hard sphere gas diverges at the so called Glass Close Packing (GCP) point with φ GCP ≈ 0.65 [20,21,23]. From which follows that the system runs out of nonoverlapping configurations and S HS goes to zero.…”
Section: Granular Physics Happens At Volume Fractions Inaccessible Tomentioning
confidence: 99%
“…This excludes both packings crystallizing in FCC and HCP configurations at volume fractions above φ g ≈ 0.65 [15][16][17][18][19][20][21] 1 and the "tunneled crystal" packings at φ g = 0.49 [22]. Neither of these two configurations are extensive, i.e.…”
Section: Granular Physics Happens At Volume Fractions Inaccessible Tomentioning
confidence: 99%
See 1 more Smart Citation
“…However the study of these geometries can be relevant for other problems such as solid heterogeneous materials or multiphase dispersed flows. To recreate more realistic granular and consolidated porous media, many algorithms have been proposed (see [18,19] and references therein). In this work an extended version of the Jodrey-Tory algorithm [20] has been used, that consists in a post-processing iterative greedy-type moves to displace overlapping or detached grains.…”
Section: Random Arrangementsmentioning
confidence: 99%