arXiv · cond-mat/0101336
Heap-based algorithm for one-dimensional particle systems
Abstract
A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future events. In the limit of large number of particles $N$, the operation count is dominated by the cost of reordering the heap after each event, which goes asymptotically as $\log N$. Some applications are discussed in detail.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alain Noullez, Duccio Fanelli, Erik Aurell. 2001-01-22. Heap-based algorithm for one-dimensional particle systems. https://arxiv.org/abs/cond-mat/0101336
Cite the original work for its findings. Save a collection to share your selection of sources.