English

Efficient parallel algorithm for estimating higher-order polyspectra

Cosmology and Nongalactic Astrophysics 2019-09-04 v1

Abstract

Nonlinearities in the gravitational evolution, galaxy bias, and redshift-space distortion drive the observed galaxy density fields away from the initial near-Gaussian states. Exploiting such a non-Gaussian galaxy density field requires measuring higher-order correlation functions, or, its Fourier counterpart, polyspectra. Here, we present an efficient parallel algorithm for estimating higher-order polyspectra. Based upon the Scoccimarro estimator, the estimator avoids direct sampling of polygons by using the Fast-Fourier Transform (FFT), and the parallelization overcomes the large memory requirement of the original estimator. In particular, we design the memory layout to minimize the inter-CPU communications, which excels in the code performance.

Keywords

Cite

@article{arxiv.1904.11055,
  title  = {Efficient parallel algorithm for estimating higher-order polyspectra},
  author = {Joseph Tomlinson and Donghui Jeong and Juhan Kim},
  journal= {arXiv preprint arXiv:1904.11055},
  year   = {2019}
}

Comments

15 pages, 7 figures, submitted to ApJ

R2 v1 2026-06-23T08:48:48.887Z