Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 13:05, 26 January 2018

Revision as of 21:47, 11 June 2018

Line 1:

'''Lubachevsky-Stillinger (compression) algorithm''' (LS algorithm, LSA, or LS 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]].[[File:1000 triangles packed in rectangle.png|thumb|Using a variant of Lubachevsky-Stillinger algorithm, 1000 congruent isosceles triangles are randomly packed by compression in a rectangle with periodic (wrap-around) boundary. The rectangle which is the period of pattern repetition in both directions is shown. Packing density is 0.8776]]

InIt was suggested by [[F. H. Stillinger]] and B.D. Lubachevcky

==Phenomenology==