04.01.2013 Views

Springer - Read

Springer - Read

Springer - Read

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

8.4 The Kalman Recursions 273<br />

Kalman Prediction:<br />

For the state-space model (8.1.1)–(8.1.2), the one-step predictors ˆXt : Pt−1(Xt)<br />

and their error covariance matrices t E ′<br />

Xt − ˆXt Xt − ˆXt are uniquely<br />

determined by the initial conditions<br />

ˆX1 P(X1|Y0), 1 E <br />

X1 − ˆX1 X1 − ˆX1<br />

and the recursions, for t 1,...,<br />

<br />

where<br />

and −1<br />

t<br />

ˆXt+1 Ft ˆXt + t −1<br />

t<br />

Yt − Gt ˆXt<br />

t+1 FttF ′<br />

t + Qt − t −1<br />

t GttG ′<br />

t + Rt,<br />

t FttG ′<br />

t ,<br />

t ′<br />

t<br />

is any generalized inverse of t.<br />

′<br />

<br />

, (8.4.1)<br />

, (8.4.2)<br />

Proof We shall make use of the innovations It defined by I0 Y0 and<br />

<br />

+ Wt, t 1, 2,....<br />

It Yt − Pt−1Yt Yt − Gt ˆXt Gt<br />

Xt − ˆXt<br />

The sequence {It} is orthogonal by Remark 1. Using Remarks 3 and 4 and the relation<br />

Pt(·) Pt−1(·) + P(·|It) (8.4.3)<br />

(see Problem 8.12), we find that<br />

where<br />

ˆXt+1 Pt−1(Xt+1) + P(Xt+1|It) Pt−1(FtXt + Vt) + t −1<br />

t It<br />

Ft ˆXt + t −1<br />

t It, (8.4.4)<br />

t E(It I ′<br />

t<br />

) GttG ′<br />

t<br />

t E(Xt+1I ′<br />

t ) E<br />

FttG ′<br />

t .<br />

+ Rt,<br />

FtXt <br />

+ Vt<br />

<br />

Xt − ˆXt<br />

′<br />

G ′<br />

t<br />

To verify (8.4.2), we observe from the definition of t+1 that<br />

<br />

.<br />

t+1 E Xt+1X ′ <br />

t+1 − E<br />

ˆXt+1<br />

ˆX ′<br />

t+1<br />

+ W′<br />

t

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!