Optimizing tomography for weak gravitational lensing surveys
The subject of this paper is optimization of weak lensing tomography: we carry out numerical minimization of a measure of total statistical error as a function of the redshifts of the tomographic bin edges by means of a Nelder-Mead algorithm in order to optimize the sensitivity of weak lensing with...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2021
|
| In: |
Monthly notices of the Royal Astronomical Society
Year: 2020, Volume: 501, Issue: 1, Pages: 683-692 |
| ISSN: | 1365-2966 |
| DOI: | 10.1093/mnras/staa3710 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1093/mnras/staa3710
|
| Author Notes: | Marvin Sipp, Björn Malte Schäfer and Robert Reischke |
| Summary: | The subject of this paper is optimization of weak lensing tomography: we carry out numerical minimization of a measure of total statistical error as a function of the redshifts of the tomographic bin edges by means of a Nelder-Mead algorithm in order to optimize the sensitivity of weak lensing with respect to different optimization targets. Working under the assumption of a Gaussian likelihood for the parameters of a w0wa CDM (cold dark matter) model and using euclid’s conservative survey specifications, we compare an equipopulated, equidistant, and optimized bin setting and find that in general the equipopulated setting is very close to the optimal one, while an equidistant setting is far from optimal and also suffers from the ad hoc choice of a maximum redshift. More importantly, we find that nearly saturated information content can be gained using already few tomographic bins. This is crucial for photometric redshift surveys with large redshift errors. We consider a large range of targets for the optimization process that can be computed from the parameter covariance (or equivalently, from the Fisher matrix), extend these studies to information entropy measures such as the Kullback-Leibler divergence and conclude that in many cases equipopulated binning yields results close to the optimum, which we support by analytical arguments. |
|---|---|
| Item Description: | Advance Access publication 2020 November 30 Gesehen am 24.02.2021 |
| Physical Description: | Online Resource |
| ISSN: | 1365-2966 |
| DOI: | 10.1093/mnras/staa3710 |