Next: Interpolation with Fourier basis
Up: Forward interpolation
Previous: Function basis
The usual (although not unique) mathematical definition of the
continuous dot product is
| ![\begin{displaymath}
(f_1, f_2) = \int \bar{f}_1 (x) f_2 (x) dx \;,\end{displaymath}](img78.gif) |
(38) |
where the bar over f1 stands for complex conjugate (in the case of
complex-valued functions). Applying definition (
) to the
dot product in equation (
) and approximating the integral
by a finite sum on the regular grid N, we arrive at the approximate
equality
| ![\begin{displaymath}
(\psi_j (x), f (x)) = \int \bar{\psi}_j (x) f (x) dx \approx
\sum_{n \in N} \bar{\psi}_j (n) f (n)\;.\end{displaymath}](img79.gif) |
(39) |
We can consider equation (
) not only as a useful
approximation, but also as an implicit definition of the
regular grid. Grid regularity means that approximation (
)
is possible. According to this definition, the more regular the grid
is, the more accurate is the approximation.
Substituting equality (
) into equations (
)
and (
) yields a solution to the interpolation problem.
The solution takes the form of equation (
) with
| ![\begin{displaymath}
W (x, n) = \sum_{k \in K} \sum_{j \in K} \Psi^{-1}_{kj} \psi_k
(x) \bar{\psi}_j (n)\;.\end{displaymath}](img80.gif) |
(40) |
We have found a constructive way of creating the linear
interpolation operator from a specified set of basis functions.
It is important to note that the adjoint of the linear operator in
formula (
) is the continuous dot product of the
functions W (x, n) and f (x). This simple observation follows from
the definition of the adjoint operator and the simple equality
| ![\begin{eqnarray}
\left(f_1 (x), \sum_{n \in N} W (x, n) f_2 (n)\right) = \sum_{...
...mber \\ \left(\left(W (x, n), f_1 (x)\right), f_2 (n) \right) \;.\end{eqnarray}](img81.gif) |
|
| (41) |
In the final equality, we have assumed that the discrete dot product
is defined by the sum
| ![\begin{displaymath}
(f_1 (n), f_2 (n)) = \sum_{n \in N} \bar{f}_1 (n) f_2 (n) \;.\end{displaymath}](img82.gif) |
(42) |
Applying the adjoint interpolation operator to the function f,
defined with the help of formula (
), and employing
formulas (
) and (
), we discover that
| ![\begin{eqnarray}
\left(W (x, n), f (x)\right) = \sum_{k \in K} \sum_{j \in K}
...
...si_k (x), f (x)\right) = \sum_{j \in K} c_j
\psi_j (n) = f (n)\;.\end{eqnarray}](img83.gif) |
|
| (43) |
This remarkable result shows that although the forward linear
interpolation is based on approximation (
), the adjoint
interpolation produces an exact value of f (n)! The approximate
nature of equation (
) reflects the fundamental
difference between adjoint and inverse linear operators
Claerbout (1992).
When adjoint interpolation is applied to a constant function
, it is natural to require the constant output f (n) = 1.
This requirement leads to yet another general property of the
interpolation functions W (x,n):
Property 9380
| ![\begin{displaymath}
\int W (x, n) dx = 1\;.\end{displaymath}](img85.gif) |
(44) |
The functional basis approach to interpolation is well developed in
the sampling theory Garcia (2000). Some classic examples are discussed
in the next section.
Next: Interpolation with Fourier basis
Up: Forward interpolation
Previous: Function basis
Stanford Exploration Project
12/28/2000