A Hierarchical O(N) Force Calculation Algorithm

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 4 figures, accepted for publication: Journal of Computaional Physics

Scientific paper

10.1006/jcph.2002.7026

A novel code for the approximate computation of long-range forces between N mutually interacting bodies is presented. The code is based on a hierarchical tree of cubic cells and features mutual cell-cell interactions which are calculated via a Cartesian Taylor expansion in a symmetric way, such that total momentum is conserved. The code benefits from an improved and simple multipole acceptance criterion that reduces the force error and the computational effort. For N>10^4, the computational costs are found empirically to rise sub-linear with N. For applications in stellar dynamics, this is the first competitive code with complexity O(N), it is faster than the standard tree code by a factor ten or more.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Hierarchical O(N) Force Calculation Algorithm 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 A Hierarchical O(N) Force Calculation Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Hierarchical O(N) Force Calculation Algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-328983

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.