|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'585
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Fast Algorithms and Efficient Statistics: N-point Correlation Functions | | Andrew Moore
; Andy Connolly
; Chris Genovese
; Alex Gray
; Larry Grone
; Nick Kanidoris II
; Robert Nichol
; Jeff Schneider
; Alex Szalay
; Istvan Szapudi
; Larry Wasserman
; | | Date: |
14 Dec 2000 | | Subject: | astro-ph | | Affiliation: | CMU), Andy Connolly (UPitt), Chris Genovese (CMU), Alex Gray (CMU), Larry Grone (CMU), Nick Kanidoris II (CMU), Robert Nichol (CMU), Jeff Schneider (CMU), Alex Szalay (JHU), Istvan Szapudi (CITA), Larry Wasserman (CMU | | Abstract: | We present here a new algorithm for the fast computation of N-point correlation functions in large astronomical data sets. The algorithm is based on kdtrees which are decorated with cached sufficient statistics thus allowing for orders of magnitude speed-ups over the naive non-tree-based implementation of correlation functions. We further discuss the use of controlled approximations within the computation which allows for further acceleration. In summary, our algorithm now makes it possible to compute exact, all-pairs, measurements of the 2, 3 and 4-point correlation functions for cosmological data sets like the Sloan Digital Sky Survey (SDSS; York et al. 2000) and the next generation of Cosmic Microwave Background experiments (see Szapudi et al. 2000). | | Source: | arXiv, astro-ph/0012333 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER