Heap-based algorithm for one-dimensional particle systems

Simple item page
dc.creatorNoullez, Alain
dc.creatorFanelli, Duccio
dc.creatorAurell, Erik
dc.date2001-01-22
dc.date.accessioned2026-07-07T02:40:09Z
dc.date.available2026-07-07T02:40:09Z
dc.descriptionA 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.
dc.descriptionsubmitted to J. Comput. Phys
dc.identifierhttps://arxiv.org/abs/cond-mat/0101336
dc.identifierhttp://arxiv.org/abs/cond-mat/0101336
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/17280
dc.subjectDisordered Systems and Neural Networks
dc.subjectAstrophysics
dc.subjectChaotic Dynamics
dc.titleHeap-based algorithm for one-dimensional particle systems
dc.typetext

Files

Collections

arXiv