306 Handbook of Discrete-Valued Time Series
Using the analogy of classical principal components, suppose for a xed value of ω,we
want to nd a complex-valued univariate process Y
t
(ω) = c(ω)
∗
X
t
, where c(ω) is com-
plex, such that the spectral density of Y
t
(ω) is maximized at frequency ω,and c(ω) is of
unit length, c(ω)
∗
c(ω) = 1. Because, at frequency ω, the spectral density of Y
t
(ω) is f
y
(ω) =
c(ω)
∗
f
xx
(ω)c(ω), the problem can be restated as, nd complex vector c(ω) such that
c(ω)
∗
f
xx
(ω)c(ω)
max
. (13.15)
c(ω)=0
c(ω)
∗
c(ω)
Let {(λ
1
(ω), e
1
(ω)) ,…, (λ
p
(ω), e
p
(ω))} denote the eigenvalue–eigenvector pairs of f
xx
(ω),
where λ
1
(ω) ≥ λ
2
(ω) ≥ ··· ≥ λ
p
(ω) ≥ 0, and the eigenvectors are of unit length. We
note that the eigenvalues of a Hermitian matrix are real. The solution to (13.15) is to choose
c(ω) = e
1
(ω), in which case the desired linear combination is Y
t
(ω) = e
1
(ω)
∗
X
t
. For this
choice,
c(ω)
∗
f
xx
(ω)c(ω)
e
1
(ω)
∗
f
xx
(ω)e
1
(ω)
max
= = λ
1
(ω). (13.16)
c(ω)=0
c(ω)
∗
c(ω) e
1
(ω)
∗
e
1
(ω)
This process may be repeated for any frequency ω, and the complex-valued process,
Y
t1
(ω) = e
1
(ω)
∗
X
t
, is called the rst principal component at frequency ω.The kth prin-
cipal component at frequency ω,for k = 1, 2, ... , p, is the complex-valued time series
Y
tk
(ω) = e
k
(ω)
∗
X
t
, in analogy to the classical case. In this case, the spectral density of
Y
tk
(ω) at frequency ω is f
y
k
(ω) = e
k
(ω)
∗
f
xx
(ω)e
k
(ω) = λ
k
(ω).
The previous development of spectral domain principal components is related to the
spectral envelope methodology as discussed in equation (13.4). In particular, the spectral
envelope is a principal component analysis on the real part of f
xx
(ω). Hence, the difference
between spectral domain principal component analysis and the spectral envelope is that,
for the spectral envelope, the c(ω) are restricted to be real. If, in the development of the
spectral envelope, we allowed for complex scalings, the two methods would be identical.
Another way to motivate the use of principal components in the frequency domain was
given in Brillinger (1981, Chapter 9). Although the technique appears to be different, it
leads to the same analysis. In this case, we suppose we have a stationary, p-dimensional,
vector-valued process X
t
and we are only able to keep a univariate process Y
t
such that,
when needed, we may reconstruct the vector-valued process, X
t
, according to an optimal-
ity criterion. Specically, we suppose we want to approximate a mean-zero, stationary,
vector-valued time series, X
t
, with spectral matrix f
xx
(ω), by a univariate process Y
t
dened by
∞
∗
Y
t
= c
t−j
X
j
, (13.17)
j=−∞
where {c
j
} is a p × 1 vector-valued lter, such that {c
j
} is absolutely summable; that is,
∞
j=−∞
|c
j
| < ∞. The approximation is accomplished so the reconstruction of X
t
from
y
t
,say,
∞
X
t
= b
t−j
Y
j
, (13.18)
j=−∞