Identification of ‘ moving average’ plants under unobservable disturbances (Q3691561)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3916158
Language Label Description Also known as
default for all languages
No label defined
    English
    Identification of ‘ moving average’ plants under unobservable disturbances
    scientific article; zbMATH DE number 3916158

      Statements

      Identification of ‘ moving average’ plants under unobservable disturbances (English)
      0 references
      0 references
      1985
      0 references
      identification problem
      0 references
      moving average'' plant
      0 references
      closured'' noise
      0 references
      asymptotic properties
      0 references
      algorithms
      0 references
      estimates of the plant parameters
      0 references
      rate of convergence
      0 references
      The author considers the identification problem for the ''moving average'' plant described by the equation \(Z(n)=\xi (n)+\sum^{m}_{k=1}d_ k\xi (n-k)\); \(\xi (s)=0\), \(S<0\), where \(\{\) \(\xi\) (n)\(\}\) is a sequence of independent random values with \(M\{\xi (n)\}=0\); \(M\{\xi^ 2(n)\}=\sigma^ 2\); \(\xi\) (n)\(\in R\); \(d_ k\) \((k=1,...,m)\) are the unknown plant parameters to be estimated. Only output values z(k) \((k<n)\) are assumed to be observable; the input values of \(\xi\) (k) are unobservable. This problem features all the complications of identifying a plant exposed to ''closured'' noise. Unlike the conventional methods a method for identification of such plants without a priori information as to whether the plant is minimum or non- minimum phase is presented. The author introduces an equation set for the plant parameter vector. The set differs from the conventional case in using both pairwise correlation and a higher (fourth) order correlation. The asymptotic properties of the algorithms obtained by this method are examined. Classes of plants are specified for which these algorithms lead either to strongly consistent estimates of the plant parameters or to mean-square convergence to the true parameters. The rate of convergence is analysed.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references