Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 13:15, 21 May 2011

Revision as of 10:32, 22 May 2011

Line 1:

{{Orphan|date=May 2011}}

{{Userspace draft|source=ArticleWizard|date=April 2011}}

Line 12 ⟶ 14:

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>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 75 ⟶ 77:

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>.

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 122 ⟶ 124:

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,

Journal of Computational Physics

Volume 34 Issue 2, 1980

</ref>,

the LSA is distinguished by a simpler

[[data structure]]

Line 264 ⟶ 266:

<!--- Categories --->

{{DEFAULTSORT:Lubachevsky-Stillinger Algorithm}}

[[Category:Algorithms| ]]

[[Category:Computational science]]

Line 269 ⟶ 272:

[[Category:Granular materials| ]]

[[Category:Events (computing)]]

[[Category:Articles created via the Article Wizard]]