Stochastic adaptive pole-zero assignment with convergence analysis (Q1076655)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stochastic adaptive pole-zero assignment with convergence analysis |
scientific article; zbMATH DE number 3954780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastic adaptive pole-zero assignment with convergence analysis |
scientific article; zbMATH DE number 3954780 |
Statements
Stochastic adaptive pole-zero assignment with convergence analysis (English)
0 references
1986
0 references
Given a multidimensional ARMAX model \(A(z)y_{n+1}=B(z)u_ n+C(z)w_{n+1}\), where \((u_ n)\) is a sequence of controls and \((w_ n)\) is a noise sequence, the problem is to estimate the vector \(\theta\) of unknown coefficients of the matrix polynomials A(z), B(z) and C(z). For a certain input sequence \((u^ o_ n)\) a sequence \((\theta_ n)\) of strongly consistent estimators for \(\theta\) is constructed by means of a stochastic gradient algorithm.
0 references
multidimensional ARMAX model
0 references
strongly consistent estimators
0 references
stochastic gradient algorithm
0 references
0 references