Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 02:58, 7 April 2011

Revision as of 05:21, 9 April 2011

Line 1:

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

'''Lubachevsky-Stillinger (compression) algorithm''' (LS algorithm, LSA,

or LS protocol) sometimes also called is

Lubachevsky-Stillinger compression algorithm

or protocol) is

a numerical procedure that simulates or imitates

a physical process of compressing an assembly

of hard particles. As the LSA may need thousands of arithmetic operations even for a few particles,

it is usually carried out on a digital computer.

A real physical process of compression typicallyoften

involves a contracting hard boundary of the container,

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

such a scenario, like in ???.

However,

where the LSA was firstly

in a more frequently used setting and in the

introduced ??? in the setting with periodic

example reported in paper ???,

boundary conditions

where the LSA was firstly

where

introduced,

the virtual particles are compressed

the LSA compresses

the virtual particles by "swelling" or expanding them

in a fixed, final (but not necessarily bounded if a periodic

virtual volume without hard boundary.

boundary condition is adopted as is done in ???)

virtual volume.

The absolute sizes of the particles are increasing but particle-to-particle relative sizes remain constant.

As a result, in a final, compressed, or "jammed" state,

Line 41 ⟶ 38:

== References ==

* (LS 90): B.D. Lubachevsky and F.H. Stillinger,

Geometric Properties of Random Disk Packings,

Journal of Statistical Physics 60, nos. 5/6 (1990)

[http://www.princeton.edu/~fhs/geodisk/geodisk.pdf]

<!--- See http://en.wikipedia.org/wiki/Wikipedia:Footnotes on how to create references using <ref></ref> tags which will then appear here automatically -->

{{Reflist}}