Emilie Epeka Mbambe, Angèle Yule Sotazo, Jacques Sabiti Kiseta, Roger Akumoso Liendi
{"title":"A Fast Algorithm for Estimating Parameters of a Multivariate Autoregressive Moving Average Processes","authors":"Emilie Epeka Mbambe, Angèle Yule Sotazo, Jacques Sabiti Kiseta, Roger Akumoso Liendi","doi":"10.47285/isr.v2i2.103","DOIUrl":null,"url":null,"abstract":"We propose in this paper a fast and iterative algorithm for estimating the parameters of a Gaussian vector autoregressive-moving average (VARMA) model. This algorithm is a multivariate generalization of that suggested by Sabiti (1996) for estimating the parameters of a univariate ARMA(p,q) process. It is proposed, mainly for providing initial estimators for the iterative maximization of a log-likelihood function. Comparisons about the number of computations in terms of multiplication operations are made with a method that uses gradients to locate a maximum of the likelihood function and the fast method suggested by Spliid (1983).","PeriodicalId":81558,"journal":{"name":"International science review series","volume":"45 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International science review series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47285/isr.v2i2.103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We propose in this paper a fast and iterative algorithm for estimating the parameters of a Gaussian vector autoregressive-moving average (VARMA) model. This algorithm is a multivariate generalization of that suggested by Sabiti (1996) for estimating the parameters of a univariate ARMA(p,q) process. It is proposed, mainly for providing initial estimators for the iterative maximization of a log-likelihood function. Comparisons about the number of computations in terms of multiplication operations are made with a method that uses gradients to locate a maximum of the likelihood function and the fast method suggested by Spliid (1983).