Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6869195 | Computational Statistics & Data Analysis | 2016 | 12 Pages |
Abstract
An algorithm for the evaluation of the exact Gaussian likelihood of an r-dimensional vector autoregressive-moving average (VARMA) process of order (p, q), with time-dependent coefficients, including a time dependent innovation covariance matrix, is proposed. The elements of the matrices of coefficients and those of the innovation covariance matrix are deterministic functions of time and assumed to depend on a finite number of parameters. These parameters are estimated by maximizing the Gaussian likelihood function. The advantages of that approach is that the Gaussian likelihood function can be computed exactly and efficiently. The algorithm is based on the Cholesky decomposition method for block-band matrices. It is shown that the number of operations as a function of p, q and n, the size of the series, is barely doubled with respect to a VARMA model with constant coefficients. A detailed description of the algorithm followed by a data example is provided.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Abdelkamel Alj, Kristján Jónasson, Guy Mélard,