Recursive estimation based on an extended observation vector (Q790782)
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: Recursive estimation based on an extended observation vector |
scientific article; zbMATH DE number 3849109
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive estimation based on an extended observation vector |
scientific article; zbMATH DE number 3849109 |
Statements
Recursive estimation based on an extended observation vector (English)
0 references
1983
0 references
The author considers the construction of a suboptimal filtering algorithm of assigned order N with a memory of \(\tau\) steps for a partially observable stochastic sequence \(z_ t=(x_ t,y_ t)\) described by the system of difference equations \[ x_ t=a_ 1(t,\epsilon_ t)+b_ 1(t,\epsilon_ t)x_{t-1}+u_ 1(t-1)+d_ 1(t,\epsilon_ t)y_{t-1}, \] \[ y_ t=a_ 2(t,\epsilon_ t)+b_ 2(t,\epsilon_ t)x_{t- 1}+u_ 2(t-1)+d_ 2(t,\epsilon_ t)y_{t-1}, \] where the controls \(u_ 1(t-1)\) and \(u_ 2(t-1)\) are expressed linearly in terms of linear estimates of the unobservable component \(x_ t\) of \(z_ t\) on the basis of realizations of the observable component \(y_ t\) of \(z_ t\) and \(\epsilon_ t\) is a sequence of independent random vectors with independent components whose distribution is assumed to be known. The proposed algorithm gives estimates whose accuracy is higher than that of linear estimates, this being due to the use of polynomial functions of \(y_ t\).
0 references
polynomial functions of the observable component
0 references
suboptimal filtering algorithm
0 references
partially observable stochastic sequence
0 references
0 references
0.87396777
0 references
0 references
0 references
0.86284745
0 references
0.8620566
0 references