Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 13:53, 6 May 2011

Revision as of 14:12, 6 May 2011

Line 160:

rate

along the approach to a certain simulated time.

The rate will be not only increasing without

a bound in proportion to

a bound but will be also outstandingly higher

than the rates of collisions in the rest of the particle ensemble.

If this happens,

then the simulation will be stuck in time,

Line 180:

</ref>

because

it often occurs in hard particle granular flowsuch simulations when

[[restitution coefficient]]

at collisions is low (and hence

(and hence the collisions are inelastic).

The failure is not specific to just the LSA algorithm.

Techniques to avoid the failure have

Line 195:

== History ==

The LSA was a by-product of an attempt to find

a fair measure of [[speedup]] in [[parallel]] [[simulations]]. The

[[Time Warp]] parallel simulation algorithm

by David Jefferson was advanced as a method