next up previous print clean
Next: Recursions: order updating Up: THE LSL ALGORITHM Previous: Forward residuals

Backward residuals

We define the vectors of backward residuals rk,T-1 with the recursions:  
 \begin{displaymath}
\!\!\left\{\begin{array}
{lll}
\!r_{0,T-1}&=&Zy_T \\ \!r_{k,...
 ...over r'_{k-1,T-1}r_{k-1,T-1}}}r_{k-1,T-1}\;. \end{array}\right.\end{displaymath} (1)
The index $T\!-\!1$ appears because these residuals can all be expressed as Z applied to a known vector: r0,T=yT for example. These recursions are in fact equivalent to performing a Gram-Schmidt orthogonalization of the space $(Zy_T,\cdots,Z^ny_T)$. Then, for any k, the space $(r_{0,T-1},\cdots,r_{k,T-1})$ is equal to $(Zy_T,\cdots,Z^{k+1}y_T)$; also, rk,T-1 is orthogonal to $(r_{0,T-1},\cdots,r_{k-1,T-1})$.So, with these recursions, we see that rk,T-1 is the orthogonal complement of the shifted data Zk+1yT on $(Zy_T,\cdots,Z^ky_T)$:

\begin{displaymath}
r_{k,T-1}=P^{\perp}_{1,k,T}(Z^{k+1}y_T) \mbox{\hspace{1.0cm} for all } k=0,\cdots,n-1\;.\end{displaymath}

In other words, rk,T-1(t) is the residual obtained from the optimal prediction of y(t-(k+1)) with the future values $y(t-1),\cdots,y(t-k)$;this explains the term ``backward'' residuals. The geometrical interpretations of $\varepsilon_{k,T}$ and rk,T-1 appear together on Figure [*].

Geometrical interpretation of the residuals $\varepsilon_{k,T}$ and rk,T-1.
$\varepsilon_{k,T}$ is the orthogonal complement of the data yT on Y1,k,T.
The predictable part of yT of order k is the orthogonal projection of yT on Y1,k,T.
rk,T-1 is the orthogonal complement of the shifted data Zk+1yT on Y1,k,T.
The new space of regressors Y1,k+1,T is $Y_{1,k,T}\oplus Z^{k+1}y_T$.
$\varepsilon_{k+1,T}$ is the orthogonal complement of yT on Y1,k+1,T.
$\varepsilon_{k+1,T}-\varepsilon_{k,T}$ is equal to rk,T-1 multiplied by the reflection coefficient Krk+1.

Finally, knowing that the forward residuals $\varepsilon_{k,T}$ are the orthogonal complement of yT on $(Zy_T,\cdots,Z^ky_T)$, so on $(r_{0,T-1},\cdots,r_{k-1,T-1})$, we have the recursive formulas:  
 \begin{displaymath}
\!\!\left\{\begin{array}
{lll}
\!\varepsilon_{0,T}&=&y_T \no...
 ...\over r'_{k-1,T-1}r_{k-1,T-1}}}r_{k-1,T-1}\;.\end{array}\right.\end{displaymath}   


next up previous print clean
Next: Recursions: order updating Up: THE LSL ALGORITHM Previous: Forward residuals
Stanford Exploration Project
1/13/1998