Statistics – Computation
Scientific paper
Feb 1990
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1990apj...349..562h&link_type=abstract
Astrophysical Journal, Part 1 (ISSN 0004-637X), vol. 349, Feb. 1, 1990, p. 562-569. Research supported by the Pittsburgh Superco
Statistics
Computation
63
Astronomical Models, Many Body Problem, Stellar Motions, Algorithms, Computational Astrophysics
Scientific paper
Empirical tests are used to measure relaxation rates in direct summation, hierarchical tree, and spherical harmonic N-body codes. We find that these methods suffer from comparable levels of relaxation for the same particle number and effective spatial resolution. This conclusion is counter to the wide-spread belief that expansion techniques are intrinsically less collisional than other methods. In fact, any algorithm which represents the density field using discrete particles will be subject to fluctuations in the potential, resulting in departures from the mean-field limit. Given appropriate resources, direct summation and hierarchical tree methods are valid approaches for simulating collisionless systems. The suitability of a given technique for studying collisionless processes is determined only by considerations of efficiency.
Barnes Joshua E.
Hernquist Lars
No associations
LandOfFree
Are some N-body algorithms intrinsically less collisional than others? 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 Are some N-body algorithms intrinsically less collisional than others?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Are some N-body algorithms intrinsically less collisional than others? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1841379