Volume 374, Number 1, July IV 2001
|Page(s)||358 - 370|
|Section||Numerical methods and codes|
|Published online||15 July 2001|
MAPCUMBA: A fast iterative multi-grid map-making algorithm for CMB experiments
Institut d'Astrophysique de Paris, 98bis, Boulevard Arago, 75014 Paris, France
2 Service d'Astrophysique, DAPNIA, Centre d'Études de Saclay, 91191 Gif-sur-Yvette, France
3 CITA, McLennan Labs, 60 St George Street, Toronto, ON M5S 3H8, Canada
Corresponding author: O. Doré, email@example.com
Accepted: 2 May 2001
The data analysis of current Cosmic Microwave Background (CMB) experiments like BOOMERanG or MAXIMA poses severe challenges which already stretch the limits of current (super-) computer capabilities, if brute force methods are used. In this paper we present a practical solution for the optimal map making problem which can be used directly for next generation CMB experiments like ARCHEOPS and TopHat, and can probably be extended relatively easily to the full PLANCK case. This solution is based on an iterative multi-grid Jacobi algorithm which is both fast and memory sparing. Indeed, if there are data points along the one dimensional timeline to analyse, the number of operations is of and the memory requirement is . Timing and accuracy issues have been analysed on simulated ARCHEOPS and TopHat data, and we discuss as well the issue of the joint evaluation of the signal and noise statistical properties.
Key words: methods: data analysis / cosmic microwave background
© ESO, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.