Algorithm for random close packing of spheres with periodic boundary conditions
type: Item
instance of: scholarly article
title: Algorithm for random close packing of spheres with periodic boundary conditions
zbMATH Open document ID: 0810.65002
author: Alexander Z. Zinchenko
published in: Journal of Computational Physics
publication date: 1994-12-06T00:00:00Z
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).
reviewed by: Katsuji Uosaki
Mathematics Subject Classification ID: 65C20
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 52C15
zbMATH DE Number: 699534
zbMATH Keywords: periodic boundary condition
zbMATH Keywords: isotropic algorithm
zbMATH Keywords: kinetics-independent
zbMATH Keywords: random close packing
zbMATH Keywords: spheres
zbMATH Keywords: perfect contact network
describes a project that uses: symrcm
MaRDI profile type: Publication
full work available at URL: jcph.1994.1168
OpenAlex ID: W2051544751
cites work: Simulation of random packing of spheres
cites work: An efficient algorithm for calculating multiparticle thermal interaction in a concentrated dispersion of spheres
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q3994787
cites work: Q3664299
cites work: Q4056140
DOI: 10.1006/JCPH.1994.1168
description: scientific article; zbMATH DE number 699534