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.
| Original language | English |
|---|---|
| Pages (from-to) | 633-644 |
| Number of pages | 12 |
| Journal | Computational Statistics and Data Analysis |
| Volume | 100 |
| DOIs | |
| Publication status | Published - 1 Aug 2016 |
Bibliographical note
Funding Information: The authors thank the Deutsche Forschungsgemeinschaft (grants Fr456/12-1 and SFB262-D12), the United States National Science Foundation (grant DM 88-15723) and the Semmelweis University of Medicine, Budapest for financial support. Publisher Copyright: © 2014 Elsevier B.V.Other keywords
- Cholesky decomposition method
- Time-varying models
- Vector VARMA
Fingerprint
Dive into the research topics of 'The exact Gaussian likelihood estimation of time-dependent VARMA models'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver