Astronomy and Astrophysics – Astrophysics
Scientific paper
2003-05-23
New Astron. 10 (2005) 569-590
Astronomy and Astrophysics
Astrophysics
37 pages, 6 figures, LaTeX; added and modified figures, modified theoretical estimate of computing time; accepted by New Astro
Scientific paper
10.1016/j.newast.2005.04.002
We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N log N) time for N particles, instead of O(N^n) as required by brute force approaches. The algorithm enables an estimate of the full 3PCF for as many as 10^6 galaxies. This technique exploits node-to-node correlations of a recursive bisectional binary tree. A balanced tree construction minimizes the depth of the tree and the worst case error at each node. The algorithm presented in this paper can be applied to problems with arbitrary geometry. We describe the detailed implementation to compute the two point function and all eight components of the 3PCF for a two-component field, with attention to shear fields generated by gravitational lensing. We also generalize the algorithm to compute the n-point correlation function for a scalar field in k dimensions where n and k are arbitrary positive integers.
Pen U.-L.
Zhang Lucy Liuxuan
No associations
LandOfFree
Fast n-point correlation functions and three-point lensing application 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 n-point correlation functions and three-point lensing application, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast n-point correlation functions and three-point lensing application will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-133028