Changeset 290 for doc/tutorial
- Timestamp:
- 03/06/09 15:03:45 (16 years ago)
- Files:
-
- 1 modified
Legend:
- Unmodified
- Added
- Removed
-
doc/tutorial/tut_arx.dox
r272 r290 30 30 For online estimation with stationary parameters can be easily achieved by collecting the sufficient statistics described above recursively. 31 31 32 Extension to non-stationaly parameters, \f$ \theta_t , r_t \f$ can be achieved by operation called forgetting. This is an approximation of Bayesian filtering see [Kulhavy]. The resulting algorithm is defined by manipulation of s fficient statistics:32 Extension to non-stationaly parameters, \f$ \theta_t , r_t \f$ can be achieved by operation called forgetting. This is an approximation of Bayesian filtering see [Kulhavy]. The resulting algorithm is defined by manipulation of sufficient statistics: 33 33 <dl> 34 34 <dt>Information matrix</dt> <dd>which is a sum of outer products \f[ 35 V_t = V_{t-1} + \phi\left[\begin{array}{c}y_{t}\\ \psi_{t}\end{array}\right]35 V_t = \phi V_{t-1} + \left[\begin{array}{c}y_{t}\\ \psi_{t}\end{array}\right] 36 36 \begin{array}{c} [y_{t}',\,\psi_{t}']\\ \\\end{array} 37 37 +(1-\phi) V_0 38 38 \f]</dd> 39 39 <dt>"Degree of freedom"</dd> <dd>which is an accumulator of number of data records \f[ 40 \nu_t = \ nu_{t-1} + \phi+ (1-\phi) \nu_040 \nu_t = \phi \nu_{t-1} + 1 + (1-\phi) \nu_0 41 41 \f]</dd> 42 42 </dl>