Implicit finite difference in time-space domain with the helix transform |
The finite-difference weights for the 2-D case of matrix
(where
) are derived by using the same finite-difference approximation (2nd order in time and space) as in Equation 9. The derived linear equation system is similar to the one shown in (10), except that two off-diagonal bands appear at a certain offset from the main diagonal. The offset is equal to the number of elements of the ``fast'' axis of the 2D wavefield.
where the finite-difference weights are:
and where
The propagation methodology is the same as shown in Equation 14 - creation of a solution vector, and then two deconvolutions using the SEPlib polydiv module.
The main advantage in comparison to a standard linear equation system solver is in the reduced number of operations required to propagate the wavefield by one time step. The computation time scales linearly with the size of the data and the number of factorized filter coefficients, instead of the square of the size of the data. Coupled with the larger time steps which are made possible by an implicit finite-difference scheme, this methodology has the potential to reduce total processing times for wavefield propagation algorithms. The further advantage is the separation of the solution from the dimensionality of the problem.
Implicit finite difference in time-space domain with the helix transform |