next up previous contents
Next: Implementations and Examples Up: Shadows in Infinite Dimensional Previous: Covariance Decomposition

Formulation of Discrete Time Kalman Filter

So we have that

eqnarray643

We can now, given the value of tex2html_wrap_inline1051 , propagate our state estimate from tex2html_wrap_inline1055 to tex2html_wrap_inline947 . We are not yet able, however, to propagate our error covariance matrix. We need to look at

eqnarray646

so that

eqnarray653

This last step is obtained by substituting in our expression for tex2html_wrap_inline1031 , hacking away with matrix algebra, then reexpressing in terms of tex2html_wrap_inline1031 . Now, all we need is the propagation from posteriori error last turn to a priori error this turn.

eqnarray660

Combining these last two re-expressions, we see that

equation670

Which allows us to directly propagate our error covariance from n to n+1. If we express tex2html_wrap_inline947 as a function of tex2html_wrap_inline1069 and tex2html_wrap_inline1055 we'll have our recursive estimation sequence. Combining equations tex2html_wrap_inline1073 and tex2html_wrap_inline1075 , we have:

equation674

where

equation677

This, albeit in an aethetically treasonous form, is our Discrete Time Kalman time filter.



Scot Free Kennedy
Sat Sep 13 00:27:51 PDT 1997