138 ANALY SIS OF TIME SERIES WITH A STATE-SPACE MODEL
9.2 State Estimation via the Kalman Filter
A particularly impor tant problem in state-sp a ce modeling is to estimate
the state x
n
based on the o bservations of the time ser ie s y
n
. The reason
is that tasks such a s prediction, interpolatio n a nd likelihood computa-
tion for the time series can be systematically analyzed by usin g the state
estimation.
In this section, we shall consider the problem of estimating the state
x
n
at time n based on the set of observations Y
j
= {y
1
,···, y
j
}. In particu-
lar, for j < n, the state estimation problem is equivalent to estimation of
the future state b ased on the present and past observations an d is called
prediction. For j = n, the problem is to estimate the current state, which
is called a filter. On the other hand, for j > n, the prob le m is to estimate
a past state x
j
based on the observations until the present time and this is
called smoothing.
A gener al approach to these state estimation problems is to obtain
the conditional distribution p (x
n
|Y
j
) of the state x
n
. Then, as the state-
space model defined by (9.1) and (9.2) is a linear model, and moreover
the no ises v
n
and w
n
, and the initial state x
0
follow normal distributions,
all these conditional distributions become normal distributions. There-
fore, to solve the pro blem of state estimation of the state-space model, it
is sufficient to obtain the mean vectors and the variance-covariance ma-
trices of the co nditional distributions. In general, in order to obtain the
conditional joint distribution of states x
1
,···, x
n
given the observations
y
1
,···, y
n
, a hug e amount of computation is necessary.
However, for the state-space model, a very computationally efficient
proced ure for obtaining the joint conditional distribution of the state
has been developed by means of a recursive co mputational algorithm.
This a lgorithm is known as the Kalman filter (Kalman ( 1960), Anderson
and Moore (1976)). In the following, the c onditional expectation and the
variance-covariance matrix of the state x
n
are denoted by
x
n|j
≡ E
x
n
|Y
j
V
n|j
≡ E
(x
n
−x
n|j
)(x
n
−x
n|j
)
T
. (9.11)
It is noted that only the cond itional distributions with j = n −1 (one-
step-ahead prediction) and j = n (filter) are treated in the Kalman filter
algorithm . As shown in Figure 9.1, the Kalman filter could be realized by
repeating the one-step-ahead prediction and the filter with the following
algorithm . The derivation of the Kalman filter is shown in Appendix C.