Heap-based algorithm for one-dimensional particle systems

Details Heap-based algorithm for one-dimensional particle systems Heap-based algorithm for one-dimensional particle systems

2001-01-22

arxiv.org/abs/cond-mat/0101336v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

submitted to J. Comput. Phys

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Heap-based algorithm for one-dimensional particle systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Heap-based algorithm for one-dimensional particle systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heap-based algorithm for one-dimensional particle systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11552