Estimating N-Point Correlation Functions from Pixelized Sky Maps

Details Estimating N-Point Correlation Functions from Pixelized Sky Maps Estimating N-Point Correlation Functions from Pixelized Sky Maps

2003-10-29

arxiv.org/abs/astro-ph/0310831v2

Astrophys.J.Suppl. 151 (2004) 1-11

Astronomy and Astrophysics

Astrophysics

11 pages, 8 figures, accepted for publication in ApJS; textual improvements, references updated

Scientific paper

10.1086/381740

We develop, implement and test a set of algorithms for estimating N-point correlation functions from pixelized sky maps. These algorithms are slow, in the sense that they do not break the O(N_pix^N) barrier, and yet, they are fast enough for efficient analysis of data sets up to several hundred thousand pixels. The typical application of these methods is Monte Carlo analysis using several thousand realizations, and therefore we organize our programs so that the initialization cost is paid only once. The effective cost is then reduced to a few additions per pixel multiplet (pair, triplet etc.). Further, the algorithms waste no CPU time on computing undesired geometric configurations, and, finally, the computations are naturally divided into independent parts, allowing for trivial (i.e., optimal) parallelization.

Affiliated with

Also associated with

No associations

Rating

Estimating N-Point Correlation Functions from Pixelized Sky Maps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Estimating N-Point Correlation Functions from Pixelized Sky Maps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating N-Point Correlation Functions from Pixelized Sky Maps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-199328