Jump to content

Rybicki Press algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Monkbot (talk | contribs) at 03:04, 2 September 2015 (Task 7c: repair/replace et al. in cs1 author/editor parameters;). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Rybicki–Press algorithm is a fast direct algorithm for inverting a matrix, whose entries are given by , where .[1] It is a computational optimization of a general set of statistical methods developed to determine whether two noisy, irregularly sampled data sets are, in fact, dimensionally shifted representations of the same underlying function.[2][3]: 2  The most common use of the algorithm as of 2015 is in the detection of periodicity in astronomical observations.[citation needed]

References

  1. ^ Rybicki, George B.; Press, William H. (1995), "Class of fast methods for processing Irregularly sampled or otherwise inhomogeneous one-dimensional data", Physical Review Letters, 74: 1060, arXiv:comp-gas/9405004, doi:10.1103/PhysRevLett.74.1060 Open access icon
  2. ^ Rybicki, George B.; Press, William H. (October 1992). "Interpolation, realization, and reconstruction of noisy, irregularly sampled data". The Astrophysical Journal. doi:10.1086/171845. {{cite journal}}: |access-date= requires |url= (help)Open access icon
  3. ^ McLeod, C. L.; et al. (February 2011). "Quasar Selection Based on Photometric Variability". The Astrophysical Journal. doi:10.1088/0004-637X/728/1/26. {{cite journal}}: |access-date= requires |url= (help)Open access icon

.