Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 04:10, 26 April 2011

Revision as of 04:23, 26 April 2011

Line 112:

Journal of Computational Physics

Volume 34 Issue 2, 1980

</ref>,

, the LSA is distinguished by a simpler

[[data structure]]

and data handling.

Line 139:

increase without a bound.

Still the LSA successfully achieves the jamming state

as long as those rates remainsremain comparable among most

particles (except the rattlers, those experience

low collision rates).

Line 172:

it often occurs in hard particle granular flow simulations when

[[restitution coefficient]]

at collisions is low. (and hence

the collisions are inelastic).

Techniques to avoid the failure have

been proposed.