Extended Sparse Matrix arising from a semi-separable matrix whose semi-separable rank is .
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] The most common use of the algorithm is in the detection of periodicity in astronomical observations.[3]
Recently, this method has been extended (Generalized Rybicki Press algorithm) for inverting matrices whose entries of the form .[4] The key observation in the Generalized Rybicki Press (GPP) algorithm is that the matrix is a semi-separable matrix with rank . More precisely, if the matrix has a semi-separable rank is , the cost for solving the linear system and obtaining the determinant of the matrix scales as , thereby making it extremely attractive for large matrices. This implementation of the GPP algorithm can be found here.[5] The key idea is that the dense matrix can be converted into a sparser matrix of a larger size (see figure on the right), whose sparsity structure can be leveraged to reduce the computational complexity.
The fact that matrix is a semi-separable matrix also forms the basis for celerite[6] library, which is a library for fast and scalable Gaussian Process (GP) Regression in one dimension[7] with implementations in C++, Python, and Julia. The celerite method[7] also provides an algorithm for generating samples from a high-dimensional distribution. The method has found attractive applications in a wide range of fields, especially in astronomical data analysis.[8][9]
^Rybicki, George B.; Press, William H. (October 1992). "Interpolation, realization, and reconstruction of noisy, irregularly sampled data". The Astrophysical Journal. 398: 169. Bibcode:1992ApJ...398..169R. doi:10.1086/171845.