Efficient Parallel Algorithm for Estimating Higher-order Polyspectra

  • Tomlinson J
  • Jeong D
  • Kim J
14Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

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 using the fast Fourier transform, 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.

Cite

CITATION STYLE

APA

Tomlinson, J., Jeong, D., & Kim, J. (2019). Efficient Parallel Algorithm for Estimating Higher-order Polyspectra. The Astronomical Journal, 158(3), 116. https://doi.org/10.3847/1538-3881/ab3223

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free