The FWI method uses a preconditioned conjugate gradient method, where the acoustic forward and backward solvers are a finite-difference solution to the 2D space-time wave equation of constant density. The fdtd algorithm is second-order accurate in time and fourth-order accurate in space, denoted as . The source wavelet for the proposed frequency selection method is a pure cosine wave, also employed in Nihei and Li (2007) and Sirgue et al. (2008), at a selected frequency.
|
The starting model is shown in Figure 3.4(a) and the standard FWI tomogram after 69 iterations is shown in Figure 3.4(d). This result and the associated CPU time will serve as the standard metrics by which the fwimfs algorithm will be measured.
|
The fwimfs strategy produces the tomogram shown in Figure 3.4(c). This result required 439 iterations to achieve the same accuracy as the Figure 3.4(d) result in 69 iterations. This amounts to a factor of . The convergence curves shown in Figure 3.5 are plotted in the way that the x-axes for the red dashed curves have been deliberately shrunk by . With this adjustment, the two convergence curves of velocity error in Figure 3.5(b) almost coincide with each other. Taking this factor into account, among others such as the overhead of increased runtime per finite-difference run, the speedup over the conventional FWI scheme is estimated to be about 4. This compares to the speedup reported by Huang and Schuster (2012) for RTM. One reason for this discrepancy is that the implementation in the time domain suffers from a overhead in order to reduce the effect of transient noise in the simulated sinusoidal seismograms.
Yunsong Huang 2013-09-22