Fast Algorithms and Efficient Statistics: N-point Correlation Functions

Details Fast Algorithms and Efficient Statistics: N-point Correlation Functions Fast Algorithms and Efficient Statistics: N-point Correlation Functions

2000-12-14

arxiv.org/abs/astro-ph/0012333v1

Astronomy and Astrophysics

Astrophysics

To appear in Proceedings of MPA/MPE/ESO Conference "Mining the Sky", July 31 - August 4, 2000, Garching, Germany

Scientific paper

10.1007/10849171_5

We present here a new algorithm for the fast computation of N-point correlation functions in large astronomical data sets. The algorithm is based on kdtrees which are decorated with cached sufficient statistics thus allowing for orders of magnitude speed-ups over the naive non-tree-based implementation of correlation functions. We further discuss the use of controlled approximations within the computation which allows for further acceleration. In summary, our algorithm now makes it possible to compute exact, all-pairs, measurements of the 2, 3 and 4-point correlation functions for cosmological data sets like the Sloan Digital Sky Survey (SDSS; York et al. 2000) and the next generation of Cosmic Microwave Background experiments (see Szapudi et al. 2000).

Affiliated with

Also associated with

No associations

Rating

Fast Algorithms and Efficient Statistics: N-point Correlation Functions 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 Fast Algorithms and Efficient Statistics: N-point Correlation Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Algorithms and Efficient Statistics: N-point Correlation Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-510323