TL;DR
This paper introduces a fast, scalable algorithm for computing N-point correlation functions of 3D density fields, applicable to galaxy surveys and continuous fields, enabling more efficient cosmological analysis.
Contribution
The paper presents the ENCORE algorithm, which reduces the computational complexity of N-point correlation functions to (Ng^2) for arbitrary N, with practical implementation and GPU acceleration.
Findings
Efficient computation of 3PCF to 6PCF within 100 CPU-hours.
Algorithm scales linearly with the number of particles for higher N.
Implementation includes corrections for survey geometry and GPU acceleration.
Abstract
We present a new algorithm for efficiently computing the -point correlation functions (NPCFs) of a 3D density field for arbitrary . This can be applied both to a discrete spectroscopic galaxy survey and a continuous field. By expanding the statistics in a separable basis of isotropic functions built from spherical harmonics, the NPCFs can be estimated by counting pairs of particles in space, leading to an algorithm with complexity for particles, or when using a Fast Fourier Transform with grid-points. In practice, the rate-limiting step for will often be the summation of the histogrammed spherical harmonic coefficients, particularly if the number of radial and angular bins is large. In this case, the algorithm scales linearly with . The approach is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
