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.

242 Chapter 7 Multivariate Time Series<br />

for the multivariate AR(1) series {Xt}. By exactly the same argument as used in<br />

Example 2.2.1, we can express Xt as<br />

∞<br />

Xt j Zt−j, (7.4.4)<br />

j0<br />

provided that all the eigenvalues of are less than 1 in absolute value, i.e.„ provided<br />

that<br />

det(I − z) 0 for all z ∈ C such that |z| ≤1. (7.4.5)<br />

If this condition is satisfied, then the coefficients j are absolutely summable, and<br />

hence the series in (7.4.4) converges; i.e., each component of the matrix n j0 jZt−j converges (see Remark 1 of Section 2.2). The same argument as in Example 2.2.1 also<br />

shows that (7.4.4) is the unique stationary solution of (7.4.3). The condition that all<br />

the eigenvalues of should be less than 1 in absolute value (or equivalently (7.4.5))<br />

is just the multivariate analogue of the condition |φ| < 1 required for the existence<br />

of a causal stationary solution of the univariate AR(1) equations (2.2.8).<br />

Causality and invertibility of a multivariate ARMA(p, q) process are defined<br />

precisely as in Section 3.1, except that the coefficients ψj, πj in the representations<br />

Xt ∞ j0 ψjZt−j and Zt ∞ j0 πjXt−j are replaced by m × m matrices j<br />

and j whose components are required to be absolutely summable. The following<br />

two theorems (proofs of which can be found in TSTM) provide us with criteria for<br />

causality and invertibility analogous to those of Section 3.1.<br />

Causality:<br />

An ARMA(p, q) process {Xt} is causal, oracausal function of {Zt}, if there<br />

exist matrices {j} with absolutely summable components such that<br />

∞<br />

Xt jZt−j for all t. (7.4.6)<br />

j0<br />

Causality is equivalent to the condition<br />

det (z) 0 for all z ∈ C such that |z| ≤1. (7.4.7)<br />

The matrices j are found recursively from the equations<br />

j j +<br />

∞<br />

kj−k, j 0, 1,..., (7.4.8)<br />

k1<br />

where we define 0 I, j 0 for j>q, j 0 for j>p, and j 0 for<br />

j

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

Saved successfully!

Ooh no, something went wrong!