Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 15:31, 6 May 2011

Revision as of 16:16, 9 May 2011

Line 11:

such as a piston pressing against the particles. The LSA is able to simulate

such a scenario <ref>Boris D. Lubachevsky and Frank H. Stillinger, Epitaxial frustration in deposited packings of rigid disks and spheres. Physical Review E 70:44, 41604 (2004) http://arxiv.org/PS_cache/cond-mat/pdf/0405/0405650v5.pdf </ref>

<ref> Crystalline-Amorphous Interface Packings for Disks and Spheres, F. H. Stillinger and B. D. Lubachevsky, Crystalline-Amorphous Interface Packings for Disks and Spheres, J. Stat. Phys. 73, 497-514 (1993)</ref> .

However,

the LSA was originally introduced in the setting

Line 74:

for spherical particles, though the spheres may be

of different sizes

<ref> Computer Generation of Dense Polydisperse Sphere Packings, 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)

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

, causes thus modified LSA to slow down dramatically.

But as long as the shape is spherical,

Line 84:

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

Only a very limited experience was reported

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

in using the LSA in dimensions higher than 3.

==Implementation (how the calculations are performed)==

Line 116:

Among the [[event-driven]] algorithms intended for

the same task of simulating [[granular flow]],

like, for example, the algorithm of D.C. Rapaport

<ref> D.C. Rapaport,

The Event Scheduling Problem in Molecular Dynamic Simulation,

Line 174:

simulations

as an "inelastic collapse"

<ref> S. McNamara, S. and Young, W. R. Young, Inelastic collapse in two dimensions, Physical

Review E 50: pp. R28-R31, 1994

</ref>

Line 196:

[[Time Warp]] parallel simulation algorithm

by David Jefferson was advanced as a method

to simulate on a [[parallel computer]]

asynchronous spacial pairwise interactions

in combat models on a [[parallel computer]].

<ref>

F. Wieland, and D. Jefferson,

Case studies in serial and parallel simulations,

Proc. 1989 Int'l Conf. Parallel Processing,

Vol.III, F. Ris, F. and Kogge, M. Kogge, Eds., pp. 255-258.

</ref>

Colliding particles models