From autocovariances to moving average: An algorithm comparison

zbMATH Open0924.65155MaRDI QIDQ1297872FDOQ1297872

Authors Gabriele Fiorentini, C. Planas

Publication date 14 September 1999

Published in Computational Statistics (Search for Journal in Brave)

zbMATH Keywords

convergenceNewton-Raphson methodmoving average processesautocovariancesnonlinear equation systemspolynomial root search method

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Analysis of variance and covariance (ANOVA) (62J10) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• A simple algorithm to factorize the autocovariance function of moving average process chains
• scientific article; zbMATH DE number 4199391
• An algorithm for solving the extended Yule- Walker equations of an autoregressive moving-average time series (Corresp.)
• A note on the derivation of theoretical autocovariances for ARMA models
• Estimation of parameters of moving average processes

Cited in

(1)

• A simple algorithm to factorize the autocovariance function of moving average process chains

This page was built for publication: From autocovariances to moving average: An algorithm comparison

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