A nonsmooth program for jamming hard spheres

DOI10.1007/S11590-012-0566-5MaRDI QIDQ2439485zbMATH OpenOpenAlexFDO

Authors Peter Hinow

Publication date 14 March 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.4053

zbMATH Keywords

nonsmooth optimizationhard spheresjammed configurations

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonlinear programming (90C30)

Abstract: We study packings of $n$ hard spheres of equal radius in the $d$-dimensional unit cube. We present a nonsmooth function whose local extrema are the radii of jammed packings (where no subset of spheres can be moved keeping all others fixed) and show that for a fixed number of spheres there are only finitely many radii of such jammed configurations. We propose an algorithm for the maximization of this maximal radius function and present examples for 5 - 8 disks in the unit square and 4 - 6 spheres in the unit cube. The method allows straightforward generalization to packings of spheres in other compact containers.

Recommendations

• A linear programming algorithm to test for jamming in hard-sphere packings
• Interpolated variational iteration method for solving the jamming transition problem
• Non-jamming conditions in multi-contact rigid-body dynamics
• Analysis of an efficient algorithm for the hard-sphere problem
• Mean field theory of jamming of nonspherical particles
• On the solution of a ``solvable model of an ideal Glass of hard spheres displaying a jamming transition
• Nonsmooth contact dynamics for the large-scale simulation of granular material
• Universality of jamming of nonspherical particles
• Non-interior smoothing algorithm for frictional contact problems

Cites work

• scientific article; zbMATH DE number 432979 (Why is no real title available?)
• scientific article; zbMATH DE number 2115103 (Why is no real title available?)
• scientific article; zbMATH DE number 2237872 (Why is no real title available?)
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• A linear programming algorithm to test for jamming in hard-sphere packings
• Dense packings of equal spheres in a cube
• Derivative-free optimization methods for finite minimax problems
• Geometric properties of random disk packings.
• Improving dense packings of equal disks in a square
• More optimal packings of equal circles in a square
• New results in the packing of equal circles in a square
• On the packing of fourteen congruent spheres in a cube
• Optimization and nonsmooth analysis
• Packing of Spheres: Packing of Equal Spheres
• Packing up to 50 equal circles in a square
• Predicting the drug release kinetics of matrix tablets
• Rigidity of packings
• The Markov chain Monte Carlo revolution
• Triangle distribution and equation of state for classical rigid disks
• Unsolved problems in geometry

Cited in

(6)

• Jamming model for the extremal optimization heuristic
• Calculating the free energy of nearly jammed hard-particle packings using molecular dynamics
• A linear programming algorithm to test for jamming in hard-sphere packings
• Jamming and geometric representations of graphs
• Producing dense packings of cubes
• Dense and nearly jammed random packings of freely jointed chains of tangent hard spheres

Describes a project that uses

Uses Software

• GradSamp
• Scilab

This page was built for publication: A nonsmooth program for jamming hard spheres

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439485)