Installation
About
Likelihood evaluations for stationary Gaussian time series are typically obtained via the Durbin-Levinson algorithm, which scales as O(n^2) in the number of time series observations. This package provides a "superfast" O(n log^2 n) algorithm written in C++, crossing over with Durbin-Levinson around n = 300. Efficient implementations of the score and Hessian functions are also provided, leading to superfast versions of inference algorithms such as Newton-Raphson and Hamiltonian Monte Carlo. The C++ code provides a Toeplitz matrix class packaged as a header-only library, to simplify low-level usage in other packages and outside of R.
System requirements | fftw3 (>= 3.1.2) |
Key Metrics
Downloads
Last 24 hours | 0 -100% |
Last 7 days | 38 -30% |
Last 30 days | 226 +4% |
Last 90 days | 665 -4% |
Last 365 days | 2.764 -35% |