Lubachevsky–Stillinger algorithm: Difference between revisions

Content deleted Content added
Lsalgo (talk | contribs)
m moved User:Lsalgo/lubachevsky stillinger algorithm to Lubachevsky-Stillinger algorithm: That is how this item is most commonly named, for example, in the Web
Lsalgo (talk | contribs)
No edit summary
Line 62:
(zero outside the particle, infinity at or inside) with
a piece-wise constant [[force]] [[potential]]. The LSA
thus modified would approximateapproximately simulate
a [[molecular dynamic simulationdynamics]] with continuous
short range particle-particle force interaction.
External [[force fields]], such as [[gravitation]], can be
Line 146:
As the calculations of the LSA progress,
the collision rates of particles may and usually do
increase. without a bound.
Still the LSA successfully achievesapproaches the jamming state
as long as those rates remain comparable among all
the particles, except for the rattlers.
the
particles, except for the rattlers.
(Rattlers experience consistently low collision rates. This property allows one to detect rattlers.)
However,
Line 167 ⟶ 166:
 
The stuck-in-time failure
can also occur when using the LSAsimulating
just for simulating a granular flow,
without the particle compression
or expansion.
Line 182 ⟶ 181:
at collisions is low
(and hence the collisions are inelastic).
The failure is not specific to justonly the LSA algorithm.
Techniques to avoid the failure have
been proposed.