** Next:** Side boundaries
** Up:** RECURSIVE DIP FILTERS
** Previous:** Definition of a recursive

Implementation of the moderate bandwidth dip filters
is, again, a straightforward matter.
For example, clearing fractions, the low-pass filter becomes

| |
(22) |

The main trick is to realize that the differentiation
implied by is performed in a Crank-Nicolson sense.
That is, terms not differentiated are averaged over adjacent values.
| |
(23) |

Gathering the unknowns to the left gives
| |
(24) |

Equation (24) is a tridiagonal system of simultaneous equations
for the unknowns *q*_{ t + 1}.
The system may be solved recursively for successive values of *t*.
The parameter determines the filter cutoff.
It can be chosen to be any function of time and space.
However, if the function is to vary extremely rapidly,
then it may be necessary to incorporate some of the stability analysis
that is developed in a later chapter for use with wave equations.

** Next:** Side boundaries
** Up:** RECURSIVE DIP FILTERS
** Previous:** Definition of a recursive
Stanford Exploration Project

10/31/1997