Recursive estimation in ARMAX models

From MaRDI portal





[For the entire collection see Zbl 0761.00004.] The ARMAX system (autoregressive moving average with exogenous inputs) is defined by the linear stochastic difference equation \[ A(q^{-1})y_ n=q^{-d} B(q^{-1}) u_ n+C(q^{-1}) \varepsilon_ n, \] where \(\{u_ n\}\), \(\{y_ n\}\), \(\{\varepsilon_ n\}\) denote the input, output and disturbance sequences, \(d\geq 1\) is the delay, and \(A\), \(B\), \(C\) are scalar polynomials in the backshift operator \((q^{-1} x_ n=x_{n-1})\). In sections 2 and 3 the author reviews two classes of recursive estimators treated in the literature, namely, the stochastic approximation approach and associated martingale theory, and recursive and extended least squares. In these sections the author also outlines some of the methods used to analyze these algorithms, in particular the method of stochastic and extended stochastic Lyapunov functions. These ideas are then related, in two further sections, to recent developments on consistent recursive estimators based on the method of moments, and monitored recursive maximum likelihood and \(M\)-estimators. ``These developments not only extend important statistical properties such as consistency, asymptotic normality, asymptotic efficiency,... but are also applicable to on-line prediction and adaptive control of ARMAX systems.




Cited in
(24)








This page was built for publication: Recursive estimation in ARMAX models

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