![]() |
![]() |
![]() |
![]() | A fast algorithm for 3D azimuthally anisotropic velocity scan | ![]() |
![]() |
We now further investigate the properties of the fast algorithm using a more realistic 3D synthetic CMP gather (Figure 4). The semblance plot computed by the fast algorithm is shown in Figure 5. Figure 6a is the isotropically NMO corrected data. After residual moveout using picked velocities from the semblance, curved events are flattened to the right position (Figure 6b).
We next fix
,
and compare CPU time of the fast algorithm and the direct velocity scan for different
and
(Table 2). When
and
increase by a factor of 2, computation time of the direct velocity scan increases nearly by a factor of 4, which is consistent with our previous discussion on numerical complexity. On the other hand, CPU time of the fast algorithm is not affected much by the size of output sampling, again confirming our expectations.
![]() |
---|
data
Figure 4. 3D synthetic CMP gather. ![]() ![]() ![]() ![]() |
![]() ![]() ![]() |
![]() |
---|
NMOsemb-1
Figure 5. Semblance plot computed by the fast algorithm. ![]() ![]() |
![]() ![]() ![]() |
![]() ![]() |
---|
NMOdatacut,RMOdatacut
Figure 6. Synthetic gather (a) before and (b) after residual moveout using picked velocities from the semblance scan. |
![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
![]() | A fast algorithm for 3D azimuthally anisotropic velocity scan | ![]() |
![]() |