Analysis of an iterative reconstruction method in comparison of the standard reconstruction method

ABSTRACT We present a detailed analysis of a new iterative density reconstruction algorithm. This algorithm uses a decreasing smoothing scale to better reconstruct the density field in Lagrangian space. We implement this algorithm to run on the quijote simulations, and extend it to (a) include a smoothing kernel that smoothly goes from anisotropic to isotropic, and (b) a variant that does not correct for redshift space distortions. We compare the performance of this algorithm with the standard reconstruction method. Our examinations of the methods include cross-correlation of the reconstructed density field with the linear density field, reconstructed two-point functions, and BAO parameter fitting. We also examine the impact of various parameters, such as smoothing scale, anisotropic smoothing, tracer type/bias, and the inclusion of second order perturbation theory. We find that the two reconstruction algorithms are comparable in most of the areas we examine. In particular, both algorithms give consistent fittings of BAO parameters. The fits are robust over a range of smoothing scales. We find the iterative algorithm is significantly better at removing redshift space distortions. The new algorithm will be a promising method to be employed in the ongoing and future large-scale structure surveys.

Authors

Institutions

Publication Details

Journal
Monthly Notices of the Royal Astronomical Society
Published
2024-09-20
DOI
https://doi.org/10.1093/mnras/stae2180
Citations
4
Primary Topic
Medical Imaging Techniques and Applications
Type
article
Field-Weighted Citation Impact
1.62
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of an iterative reconstruction method in comparison of the standard reconstruction method

Nikhil Padmanabhan, Xinyi Chen
4 citations
Monthly Notices of the Royal Astronomical Society
Medical Imaging Techniques and Applications
1.62
article

Analysis of an iterative reconstruction method in comparison of the standard reconstruction method

Nikhil Padmanabhan, Xinyi Chen
article en
4 citations

Abstract

ABSTRACT We present a detailed analysis of a new iterative density reconstruction algorithm. This algorithm uses a decreasing smoothing scale to better reconstruct the density field in Lagrangian space. We implement this algorithm to run on the quijote simulations, and extend it to (a) include a smoothing kernel that smoothly goes from anisotropic to isotropic, and (b) a variant that does not correct for redshift space distortions. We compare the performance of this algorithm with the standard reconstruction method. Our examinations of the methods include cross-correlation of the reconstructed density field with the linear density field, reconstructed two-point functions, and BAO parameter fitting. We also examine the impact of various parameters, such as smoothing scale, anisotropic smoothing, tracer type/bias, and the inclusion of second order perturbation theory. We find that the two reconstruction algorithms are comparable in most of the areas we examine. In particular, both algorithms give consistent fittings of BAO parameters. The fits are robust over a range of smoothing scales. We find the iterative algorithm is significantly better at removing redshift space distortions. The new algorithm will be a promising method to be employed in the ongoing and future large-scale structure surveys.

Monthly Notices of the Royal Astronomical SocietyVol. 534(2)
Yale University (US)
Openalex Percentile: Top 16%
Medical Imaging Techniques and Applications
1.62
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.