Generalized Rybicki Press algorithm.

From MaRDI portal
Publication:5739744

DOI10.1002/NLA.2003zbMATH Open1374.65078arXiv1409.7852OpenAlexW2963033836MaRDI QIDQ5739744FDOQ5739744


Authors: Sivaram Ambikasaran Edit this on Wikidata


Publication date: 19 July 2016

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Abstract: This article discusses a more general and numerically stable Rybicki Press algorithm, which enables inverting and computing determinants of covariance matrices, whose elements are sums of exponentials. The algorithm is true in exact arithmetic and relies on introducing new variables and corresponding equations, thereby converting the matrix into a banded matrix of larger size. Linear complexity banded algorithms for solving linear systems and computing determinants on the larger matrix enable linear complexity algorithms for the initial semi-separable matrix as well. Benchmarks provided illustrate the linear scaling of the algorithm.


Full work available at URL: https://arxiv.org/abs/1409.7852




Recommendations




Cites Work


Uses Software





This page was built for publication: Generalized Rybicki Press algorithm.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739744)