Next: CONCLUSIONS
Up: FINITE DIFFERENCE METHODS
Previous: Computation of the gradient
The conjugate gradient vector has two parts. The first part
is related to the traveltime residuals, and the second part
is related to the constraints. The computation of
is simple
because matrix
is known. We want to compute
with a
finite difference method. The components of
are as follows:
| ![\begin{displaymath}
\begin{array}
{lll}
h^{(1)}_i(r) & = & \displaystyle{\sum^M_...
...j
\beta_j(\hat{x}_i(\xi,r), \hat{z}_i(\xi,r))d\xi}.\end{array}\end{displaymath}](img42.gif) |
(14) |
It is shown in Appendix A that if we solve the first-order linear PDE
| ![\begin{displaymath}
{\partial \tau_i \over \partial x}{\partial q_i \over \parti...
...artial q_i \over \partial z}=
m(x,z)\sum^M_{j=1}g_j\beta_j(x,z)\end{displaymath}](img43.gif) |
(15) |
with the initial condition that qi(x,z) is equal to zero at the source
location, then h(1)i(r) is equal to qi(x,z) at the receiver
locations. Equation (15) has a form similar to the eikonal equation;
hence we can use the algorithm for the traveltime calculation,
after being slightly modified, to solve it.
Next: CONCLUSIONS
Up: FINITE DIFFERENCE METHODS
Previous: Computation of the gradient
Stanford Exploration Project
12/18/1997