A Fast Chi-squared Technique For Period Search of Irregularly Sampled Data

A new, computationally- and statistically-efficient algorithm, the Fast \(\chi^2\) algorithm, can find a periodic signal with harmonic content in irregularly-sampled data with non-uniform errors. The algorithm calculates the minimized \(\chi^2\) as a function of frequency at the desired number of ha...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Palmer, David M
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 14.01.2009
Subjects
Algorithms
Fast Fourier transformations
Fourier transforms
Physics - Data Analysis, Statistics and Probability
Physics - Instrumentation and Methods for Astrophysics
Sampled data
Statistical tests
Online AccessGet full text
ISSN2331-8422
DOI10.48550/arxiv.0901.1913

Cover

More Information
Summary:A new, computationally- and statistically-efficient algorithm, the Fast \(\chi^2\) algorithm, can find a periodic signal with harmonic content in irregularly-sampled data with non-uniform errors. The algorithm calculates the minimized \(\chi^2\) as a function of frequency at the desired number of harmonics, using Fast Fourier Transforms to provide \(O (N \log N)\) performance. The code for a reference implementation is provided.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
LA-UR-07-8013
ISSN:2331-8422
DOI:10.48550/arxiv.0901.1913