Lubachevsky–Stillinger algorithm: Difference between revisions

Content deleted Content added
Luckas-bot (talk | contribs)
Lsalgo (talk | contribs)
No edit summary
Line 130:
For any particle at any stage of calculations
the LSA maintains the record of only two events:
an old, already processed committed event, which comprises
the processedcommitted event [[time stamp]],
the particle state
(including position and velocity),
Line 140:
and a new event proposed for a future processing
with a similar set of parameters.
The new event is not committed.
At processing the scheduled event for a particle,
whatThe wasmaximum previouslyof the newcommitted old event, istimes must never declaredexceed
the minimum of the non-committed new event times.
to be the old one,
 
Next particle to be examined by the algorithm has
the current minimum of new event times.
At examining the chosen particle,
what was previously the new event, is declared to be the old one
and to be committed,
whereas the next new event is being scheduled,
with its new [[time stamp]], new state, and new partner.
At processingAs the schedulednext new event for a particle is being set,
some of the neighboring particles may update
their non-committed new events to better account for the new
information on what actually has happened in the system
when the previously old event for the particle has been committed.
 
As the calculations of the LSA progress,