ARMA identification (Q1089301)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | ARMA identification |
scientific article |
Statements
ARMA identification (English)
0 references
1987
0 references
In view of recent results on the asymptotic behavior of the prediction error covariance for a state variable system, see \textit{R. S. Bucy} [Math. Syst. Theory 16, No.4, 307-317 (1983; Zbl 0538.93059)], an identification scheme for autoregressive moving average (ARMA) processes is proposed. The coefficients of the d-step predictor determine asymptotically the system moments \(U_ 0,...,U_{d-1}\). These moments are also nonlinear functions of the coefficients of the successive 1-step predictors. Here, we etimate the state variable parameters by the following scheme. First, we use the Burg technique, see \textit{J. P. Burg} [Maximum entropy spectral analysis, Ph. D. thes., Stanford Univ. 1975], to find the estimates of the coefficients of the successive 1-step predictors. Second, we compute the moments by substitution of the estimates provided by the Burg technique for the coefficients in the nonlinear functions relating the moments with the 1-step predictor coefficients. Finally, the Hankel matrix of moment estimates is used to determine the coefficients of the characteristic polynomial of the state transition matrix, see \textit{H. Padé} [Ann. Sci. Norm. Supér., III. Sér. 9, Suppl., 3-93 (1892)] and \textit{B. L.Ho} and \textit{R. E. Kalman} [Regelungstechnik 14, 545-548 (1966; Zbl 0145.127)]. A number of examples for the state variable systems corresponding to ARMA (2,1) processes are given which show the efficiency of this technique when the zeros and poles are separated. Some of these examples are also studied with an alternative technique, see \textit{M. I. Ribeiro} and \textit{J. M. F. Moura} [Tech. Rep. No.LIDS-P-1521, Massachusetts Inst. Technol. 1985], which exploits the linear dependence between successive 1-step predictors and the coefficients of the transfer function numerator and denominator polynomials. In this paper, the problems of order determination are not considered; we assumed the order of the underlying system. We remark that the Burg algorithm is a robust statistical procedure. With the notable exception of \textit{H. Akaike} [Ann. Inst. Stat. Math. 26, 363-387 (1974; Zbl 0335.62058)] who uses canonical correlation methods, most identification procedures in control are based on a deterministic analysis and consequently are quite sensitive to errors. In general, spectral identification based on the windowing of data lacks the resolving power of the Burg technique, which is a super resolution method.
0 references
autoregressive moving average (ARMA) processes
0 references
successive 1-step predictors
0 references
Hankel matrix of moment estimates
0 references
spectral identification
0 references
0 references