GLORIA

GEOMAR Library Ocean Research Information Access

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 55 (1987), S. 345-357 
    ISSN: 1573-2878
    Keywords: Autoregressive moving average ; ARMA ; identification ; spectral estimation ; poles ; zeros
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In view of recent results on the asymptotic behavior of the prediction error covariance for a state variable system (see Ref. 1), an identification scheme for autoregressive moving average (ARMA) processes is proposed. The coefficients of thed-step predictor determine asymptotically the system momentsU 0,...,U d−1. These moments are also nonlinear functions of the coefficients of the successive 1-step predictors. Here, we estimate the state variable parameters by the following scheme. First, we use the Burg technique (see Ref. 2) 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 Refs. 3 and 4). 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 Ref. 5) 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 Ref. 6 that 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.
    Type of Medium: Electronic Resource
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...