Astronomy and Astrophysics – Astronomy
Scientific paper
Aug 2005
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2005icar..176..432l&link_type=abstract
Icarus, Volume 176, Issue 2, p. 432-439.
Astronomy and Astrophysics
Astronomy
8
Scientific paper
We present a new code (companion) that identifies bound systems of particles in O(NlogN) time. Simple binaries consisting of pairs of mutually bound particles and complex hierarchies consisting of collections of mutually bound particles are identifiable with this code. In comparison, brute force binary search methods scale as O(N) while full hierarchy searches can be as expensive as O(N), making analysis highly inefficient for multiple data sets with N≳10. A simple test case is provided to illustrate the method. Timing tests demonstrating O(NlogN) scaling with the new code on real data are presented. We apply our method to data from asteroid satellite simulations [Durda et al., 2004. Icarus 167, 382 396; Erratum: Icarus 170, 242; reprinted article: Icarus 170, 243 257] and note interesting multi-particle configurations. The code is available at http://www.astro.umd.edu/zoe/companion/ and is distributed under the terms and conditions of the GNU Public License.
Leinhardt Zoë M.
Richardson Derek C.
No associations
LandOfFree
A fast method for finding bound systems in numerical simulations: Results from the formation of asteroid binaries 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 fast method for finding bound systems in numerical simulations: Results from the formation of asteroid binaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast method for finding bound systems in numerical simulations: Results from the formation of asteroid binaries will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-855228