Algorithm for random close packing of spheres with periodic boundary conditions

DOI10.1006/JCPH.1994.1168MaRDI QIDQ1339554zbMATH OpenOpenAlexFDO

Authors Alexander Z. Zinchenko

Publication date 6 December 1994

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcph.1994.1168

zbMATH Keywords

isotropic algorithmkinetics-independentperfect contact networkperiodic boundary conditionrandom close packingspheres

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Probabilistic models, generic numerical methods in probability and statistics (65C20)

Review text

This paper presents an isotropic kinetics-independent algorithm for random close packing (RCP) of equisized spheres with triply periodic boundaries. The algorithm provides a perfect contact network with the average coordination number six (for particle number \(N \geq 1\)) and a system of normal reactions between the spheres maintaining the structure and prohibiting further densification. Though the algorithm needs a relatively long computation time, it reproduces the experimental packing density (about 0.637).

Recommendations

• Stability and convergence analysis of a dynamics-based collective method for random sphere packing
• An efficient algorithm to generate random sphere packs in arbitrary domains
• A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
• Convergence analysis of a heuristic collective sphere packing algorithm
• On the application of random searching for the hard particles packing problem for composite solid propellant structure modeling

Cites work

• An efficient algorithm for calculating multiparticle thermal interaction in a concentrated dispersion of spheres
• Equation of state calculations by fast computing machines
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 41859 (Why is no real title available?)
• scientific article; zbMATH DE number 3470579 (Why is no real title available?)
• Simulation of random packing of spheres

Cited in

(17)

• Stochastic simulations of two-dimensional composite packings
• Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing
• Transient temperature computation of spheres in three-dimensional random packings
• A random close packing based algorithm for the generation of continuous random networks
• Statistical inference for disordered sphere packings
• An efficient algorithm to generate random sphere packs in arbitrary domains
• Application of a force field algorithm for creating strongly correlated multiscale sphere packings
• On the application of random searching for the hard particles packing problem for composite solid propellant structure modeling
• Stability and convergence analysis of a dynamics-based collective method for random sphere packing
• Random generation of periodic hard ellipsoids based on molecular dynamics: a computationally-efficient algorithm
• A second-order accurate immersed boundary-lattice Boltzmann method for particle-laden flows
• Emulsion flow through a packed bed with multiple drop breakup
• A linear programming algorithm to test for jamming in hard-sphere packings
• Damped Arrow-Hurwicz algorithm for sphere packing
• Convergence analysis of a heuristic collective sphere packing algorithm
• Algorithm for direct numerical simulation of emulsion flow through a granular material
• A particle packing algorithm for packed beds with size distribution

Describes a project that uses

Uses Software

• symrcm

This page was built for publication: Algorithm for random close packing of spheres with periodic boundary conditions

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