Skip to content

Latest commit

 

History

22 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

AMF_2PCF

Code to compute AMF kernels. Implemented with GNU GCC 11.2 and Python 3.8.12 (compiled from source with GCC)

Based on a modification of the code developed by Breton & de la Torre (arXiv:2010.02793), see https://github.com/mianbreton/RR_code

Prerequisites : Polspice http://www2.iap.fr/users/hivon/software/PolSpice/ to compute survey angular two-point function. Cuba-4.2 http://www.feynarts.de/cuba/ for 3 and 4 dimensional integrals

To run the code :

  1. First compute the radial distribution dn/dr of your survey (given your random catalog for example) and save it to an ascii file. Be cautious, as one need the exact same radial range than the one used to compute the standard multipoles (there might be a problem at the boundaries to compute dn/dr, you can either extrapolate or cut the radial range.) To compute W(theta), you should pixelized your footprint into a healpix map, to pass to the Polspice code. For BOSS/eBOSS footprint, pymangle can automatically convert the polygons into a healpix map.
  2. make
  3. ./compute_RR param_file.ini. The meaning of each parameter in the ascii file can be found in the README of https://github.com/mianbreton/RR_code if nmu > 0, the code will compute the anistropic window function W(s,mu): if nmu = 0 it will compute the window function multipoles and if nmu = -1 it will compute the AMF kernels.
  4. Once the kernels are computed, you can then extract the AMF multipoles, see the jupyter notebook for an example.

About

Code to compute AMF multipoles.

Resources

Stars

0 stars

Watchers

2 watching

Forks

Releases

Packages

Contributors

Languages