$\mathcal{O}(N^2)$时间内Galerkin三点关联函数的计算
Computing the Three-Point Correlation Function of Galaxies in $\mathcal{O}(N^2)$ Time
摘要:
本文提出了一种计算星系三点关联函数(3 PCF)多极系数的算法,该算法不考虑星系的三重态。相反,以巡天中的每个星系为中心,它以球谐函数扩展径向分仓密度场,并将这些结合起来形成多极,而不需要中心对之间的相对角度。这种方法以与两点关联函数相同的方式随数量和数量密度缩放,允许可比较的运行时间,并且比简单的三元组计数快500倍。它是准确的角度和容易处理边缘校正。我们在LasDamas SDSS-DR 7模拟星表上演示了该算法,在适度的计算资源上在一个小时内计算出边缘校正为$90\;{\rm Mpc}/h$的3 PCF。我们希望这种算法将使它有可能获得大规模的3 PCF即将到来的调查,如欧几里得,LSST和DESI。
英文摘要:
We present an algorithm that computes the multipole coefficients of the galaxy three-point correlation function (3PCF) without explicitly considering triplets of galaxies. Rather, centering on each galaxy in the survey, it expands the radially-binned density field in spherical harmonics and combines these to form the multipoles without ever requiring the relative angle between a pair about the central. This approach scales with number and number density in the same way as the two-point correlation function, allowing runtimes that are comparable, and 500 times faster than a naive triplet count. It is exact in angle and easily handles edge correction. We demonstrate the algorithm on the LasDamas SDSS-DR7 mock catalogs, computing an edge corrected 3PCF out to $90\;{\rm Mpc}/h$ in under an hour on modest computing resources. We expect this algorithm will render it possible to obtain the large-scale 3PCF for upcoming surveys such as Euclid, LSST, and DESI.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。