Heap-based algorithm for one-dimensional particle systems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
submitted to J. Comput. Phys

Keywords

Disordered Systems and Neural Networks, Astrophysics, Chaotic Dynamics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/17280

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0101336
 http://arxiv.org/abs/cond-mat/0101336

Collections

arXiv