Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming

Details Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming

2010-08-16

arxiv.org/abs/1008.2747v2

Physical Review E 82, 061302 (2010)

Physics

Condensed Matter

Statistical Mechanics

34 pages, 6 figures

Scientific paper

10.1103/PhysRevE.82.061302

We have formulated the problem of generating periodic dense paritcle packings as an optimization problem called the Adaptive Shrinking Cell (ASC) formulation [S. Torquato and Y. Jiao, Phys. Rev. E {\bf 80}, 041104 (2009)]. Because the objective function and impenetrability constraints can be exactly linearized for sphere packings with a size distribution in $d$-dimensional Euclidean space $\mathbb{R}^d$, it is most suitable and natural to solve the corresponding ASC optimization problem using sequential linear programming (SLP) techniques. We implement an SLP solution to produce robustly a wide spectrum of jammed sphere packings in $\mathbb{R}^d$ for $d=2,3,4,5$ and $6$ with a diversity of disorder and densities up to the maximally densities. This deterministic algorithm can produce a broad range of inherent structures besides the usual disordered ones with very small computational cost by tuning the radius of the {\it influence sphere}. In three dimensions, we show that it can produce with high probability a variety of strictly jammed packings with a packing density anywhere in the wide range $[0.6, 0.7408...]$. We also apply the algorithm to generate various disordered packings as well as the maximally dense packings for $d=2,3, 4,5$ and 6. Compared to the LS procedure, our SLP protocol is able to ensure that the final packings are truly jammed, produces disordered jammed packings with anomalously low densities, and is appreciably more robust and computationally faster at generating maximally dense packings, especially as the space dimension increases.

Affiliated with

Also associated with

No associations

Rating

Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming 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 Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178424