Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Journal Article

RASCALC: a jackknife approach to estimating single- and multitracer galaxy covariance matrices


Wiegand,  Alexander
Geometric Analysis and Gravitation, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Philcox, O. H. E., Eisenstein, D. J., O’Connell, R., & Wiegand, A. (2019). RASCALC: a jackknife approach to estimating single- and multitracer galaxy covariance matrices. Monthly Notices of the Royal Astronomical Society, 491(3), 3290-3317. doi:10.1093/mnras/stz3218.

Cite as: https://hdl.handle.net/21.11116/0000-0005-C4E3-D
To make use of clustering statistics from large cosmological surveys, accurate and precise covariance matrices are needed. We present a new code to estimate large-scale galaxy two-point correlation function (2PCF) covariances in arbitrary survey geometries that, due to new sampling techniques, runs ∼104 times faster than previous codes, computing finely binned covariance matrices with negligible noise in less than 100 CPU-hours. As in previous works, non-Gaussianity is approximated via a small rescaling of shot noise in the theoretical model, calibrated by comparing jackknife survey covariances to an associated jackknife model. The flexible code, rascalc, has been publicly released, and automatically takes care of all necessary pre- and post-processing, requiring only a single input data set (without a prior 2PCF model). Deviations between large-scale model covariances from a mock survey and those from a large suite of mocks are found to be indistinguishable from noise. In addition, the choice of input mock is shown to be irrelevant for desired noise levels below ∼105 mocks. Coupled with its generalization to multitracer data sets, this shows the algorithm to be an excellent tool for analysis, reducing the need for large numbers of mock simulations to be computed.