Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 12:44, 22 April 2011

Revision as of 02:19, 23 April 2011

Line 41:

(or circular in two dimensions) shape, even a simplest one, when spheres are replaced with ellipsoids (or ellipses in two dimensions)

<ref> Unusually Dense Crystal Packings of Ellipsoids, A. Donev, F.H. Stillinger, P.M. Chaikin, and S. Torquato, Phys. Rev. Letters 92, 255506 (2004)</ref>

, causes thus modified LSA to slow down dramatically.

<ref> http://www.pack-any-shape.com </ref> .

But as long as the shape is spherical,

the LSA is able to handle particle ensembles

Line 50 ⟶ 49:

<ref> Packing Hyperspheres in High-Dimensional Euclidean Spaces," M. Skoge, A. Donev, F.H. Stillinger, and S. Torquato, Phys. Rev. E 74, 041127 (2006)</ref>

in using the LSA in dimensions higher than 3.

== Comments on the algorithm ==

Particle jamming in LSA is achieved via simulating pre-jammed

[[granular flow]].

The flow is rendered as a

[[discrete event simulation]],

the events being particle-particle or particle-boundary collisions.

IfIdeally, the computations wereshould thoughthave of asbeen

being performed

with the infinite precision,.

thenThen the jamming would have

occurred [[ad infinitum]],

pastafter simulating infinitely many

collisions.

In realitypractice, the precision is finite as

is the available resolution of representing

the real numbers in the [[computer memory]],

Line 106 ⟶ 105:

== External links ==

* [http://www.examplepack-any-shape.com/ example.com] LSA generalized for

particles of arbitrary shape]