04.01.2013 Views

Springer - Read

Springer - Read

Springer - Read

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

100 Chapter 3 ARMA Models<br />

3.3 Forecasting ARMA Processes<br />

The innovations algorithm (see Section 2.5.2) provided us with a recursive method<br />

for forecasting second-order zero-mean processes that are not necessarily stationary.<br />

For the causal ARMA process<br />

φ(B)Xt θ(B)Zt, {Zt} ∼WN 0,σ 2 ,<br />

it is possible to simplify the application of the algorithm drastically. The idea is to<br />

apply it not to the process {Xt} itself, but to the transformed process (cf. Ansley, 1979)<br />

<br />

Wt σ −1 Xt, t 1,...,m,<br />

Wt σ −1 (3.3.1)<br />

φ(B)Xt, t > m,<br />

where<br />

m max(p, q). (3.3.2)<br />

For notational convenience we define θ0 : 1 and θj : 0 for j>q. We shall also<br />

assume that p ≥ 1 and q ≥ 1. (There is no loss of generality in these assumptions,<br />

since in the analysis that follows we may take any of the coefficients φi and θi to be<br />

zero.)<br />

The autocovariance function γX(·) of {Xt} can easily be computed using any of<br />

the methods described in Section 3.2.1. The autocovariances κ(i,j) E(WiWj),<br />

i, j ≥ 1, are then found from<br />

⎧<br />

σ<br />

⎪⎨<br />

κ(i,j) <br />

−2 γX(i − j), 1 ≤ i, j ≤ m<br />

σ −2<br />

<br />

<br />

p<br />

γX(i − j)− φrγX(r −|i − j|) , min(i, j) ≤ mm,<br />

r0 ⎪⎩<br />

0, otherwise.<br />

Applying the innovations algorithm to the process {Wt} we obtain<br />

⎧<br />

n<br />

⎪⎨<br />

⎪⎩<br />

ˆWn+1 <br />

ˆWn+1 <br />

j1<br />

θnj (Wn+1−j − ˆWn+1−j), 1 ≤ n

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

Saved successfully!

Ooh no, something went wrong!