Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 06:08, 23 May 2011

Revision as of 13:52, 23 May 2011

Line 73:

by a simple one-step calculation.

usingUsing LSA for spheresspherical particles of different sizes and/or for jamming in a non-commeasureable size

A substantial limitation of the original LS protocol

is that it was designed to practically work only

for spherical particles, though the spheres may be

of different sizes

<ref>A.R. Kansal, S. Torquato, and F.H. Stillinger, Computer Generation of Dense Polydisperse Sphere Packings, J. Chem. Phys. 117, 8212-8218 (2002)</ref>.

And

using LSA for spheres of different sizes and/or for jamming in a non-commeasureable size

container proved to be a useful technique

for generating and studying micro-structures formed

Line 89 ⟶ 83:

http://vismath5.tripod.com/lub/

</ref>.

It should be added that

the original LS protocol was designed

primarily

for spheres of same or different sizes

<ref>A.R. Kansal, S. Torquato, and F.H. Stillinger, Computer Generation of Dense Polydisperse Sphere Packings, J. Chem. Phys. 117, 8212-8218 (2002)</ref>.

Any deviation from the spherical

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

Line 95 ⟶ 94:

, causes thus modified LSA to slow down substantially.

But as long as the shape is spherical,

the LSA is able to handle particle ensemblesassemblies

in tens to hundreds of thousands

on today's (2011) standard [[personal computers]].