REVIEW 2 cited by
MAPCUMBA : a fast iterative multi-grid map-making algorithm for CMB experiments
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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 to 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 O(N_tod ln N_tod) 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.
Forward citations
Cited by 2 Pith papers
-
Robust CMB polarisation mapmaking with a rotating half-wave plate
POMME is a new estimator that marginalizes signals varying slower than the HWP rotation timescale to produce unbiased CMB polarisation maps with near-optimal noise in the presence of strong contaminants.
-
How many pixels are there in a polarized pulsar timing array map?
Without pulsar distances, a pulsar timing array can resolve at most about 16 sky directions times 2 polarization states, about 32 independent polarized gravitational wave sources per frequency.
Discussion (0). Continue with ORCID to comment.