.png){kind=icon}
返回
MAPCUMBA:: A fast iterative multi-grid map-making algorithm for CMB experiments
.png){kind=icon}
OA
AI
DOI：10.1051/0004-6361:20010692.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 N-tod data points along the one dimensional timeline to analyse, the number of operations is of O(N-tod InNtod) and the memory requirement is O(N-tod). 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.
Keyword:
methods
data analysis
cosmic microwave background
期刊
IF:
5.8
论文数:
5.0W
被引数:
18.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容