Reverse time migration with random boundaries

Clapp, Robert G.

doi:10.1190/1.3255432

Cited by 130 publications

(52 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, prestack wavefields does not require us to store wavefields, like RTM, as the imaging condition dos not require a crosscorrelation step. Even though, some RTM methods ( Clapp (2009)) have been proposed to solve this issue, but at an additional cost.…”

Section: Comparison With Rtmmentioning

confidence: 99%

Efficient and stable extrapolation of prestack wavefields

Alkhalifah

2013

SEG Technical Program Expanded Abstracts 2013

View full text Add to dashboard Cite

Section: Comparison With Rtmmentioning

confidence: 99%

Efficient and stable extrapolation of prestack wavefields

Alkhalifah

2013

SEG Technical Program Expanded Abstracts 2013

View full text Add to dashboard Cite

“…Another possibility is to use the random boundary technique (Clapp, 2009;Shen and Clapp, 2011), which leads to random scattering of the wavefield at the boundary. The idea is that the forward and backward wavefields have different sets of random numbers and the artifacts due to scattering do not stack in the final image.…”

Section: Migration In the Time Domainmentioning

confidence: 99%

“…Reconstruction of the forward wavefield by marching backward in time using the last two wavefields is difficult, if not impossible, in the presence of absorbing boundary conditions. Clapp (2009) has proposed to circumvent this problem by only storing boundary values of the snapshots or by using random instead of absorbing boundaries. In the latter case, the energy of the wavefield entering the boundary is scattered and does not stack during the imaging condition.…”

Section: Introductionmentioning

confidence: 99%

Closing the performance gap between an iterative frequency-domain solver and an explicit time-domain scheme for 3D migration on parallel architectures

et al. 2014

View full text Add to dashboard Cite

Three-dimensional reverse-time migration with the constantdensity acoustic wave equation requires an efficient numerical scheme for the computation of wavefields. An explicit finitedifference scheme in the time domain is a common choice. However, it requires a significant amount of disk space for the imaging condition. The frequency-domain approach simplifies the correlation of the source and receiver wavefields, but requires the solution of a large sparse linear system of equations. For the latter, we use an iterative Krylov solver based on a shifted Laplace multigrid preconditioner with matrixdependent prolongation. The question is whether migration in the frequency domain can compete with a time-domain implementation when both are performed on a parallel architecture. Both methods are naturally parallel over shots, but the frequency-domain method is also parallel over frequencies. If we have a sufficiently large number of compute nodes, we can compute the result for each frequency in parallel and the required time is dominated by the number of iterations for the highest frequency. As a parallel architecture, we consider a commodity hardware cluster that consists of multicore central processing units (CPUs), each of them connected to two graphics processing units (GPUs). Here, GPUs are used as accelerators and not as an independent compute node. The parallel implementation of the 3D migration in frequency domain is compared to a time-domain implementation. We optimize the throughput of the latter with dynamic load balancing, asynchronous I/O, and compression of snapshots. Because the frequency-domain solver uses matrix-dependent prolongation, the coarse-grid operators require more storage than available on GPUs for problems of realistic size. Due to data transfer, there is no significant speedup using GPU-accelerators. Therefore, we consider an implementation on CPUs only. Nevertheless, with the parallelization over shots and frequencies, this approach could compete with the time-domain implementation on multiple GPUs.

show abstract

“…Data compression and reconstruction can also be a good approach to tackle the issue, whereby these two schemes can always be applied in conjunction with any other strategy, including the RBC strategy adopted in this paper. In the RBC proposed by Clapp (2009), storage is reduced at the expense of additional computation. It stores source wavefields only at the two maximum time steps and repropagates the source wavefield backward at every time step, whenever they are needed to correlate the receiver wavefield.…”

Section: Introductionmentioning

confidence: 99%

Reverse time migration of 3D vertical seismic profile data

Shi

Wang

2016

GEOPHYSICS

View full text Add to dashboard Cite

Reverse time migration (RTM) has shown increasing advantages in handling seismic images of complex subsurface media, but it has not been used widely in 3D seismic data due to the large storage and computation requirements. Our prime objective was to develop an RTM strategy that was applicable to 3D vertical seismic profiling (VSP) data. The strategy consists of two aspects: storage saving and calculation acceleration. First, we determined the use of the random boundary condition (RBC) to save the storage in wavefield simulation. An absorbing boundary such as the perfect matching layer boundary is often used in RTM, but it has a high memory demand for storing the source wavefield. RBC is a nonabsorbing boundary and only stores the source wavefield at the two maximum time steps, then repropagates the source wavefield backwards at every time step, and hence, it significantly reduces the memory requirement. Second, we examined the use of the graphic processing unit (GPU) parallelization technique to accelerate the computation. RBC needs to simulate the source wavefield twice and doubles the computation. Thus, it is very necessary to realize the RTM algorithm by GPU, especially for a 3D VSP data set. GPU and central processing unit (CPU) collaborated parallel implementation can greatly reduce the computation time, where the CPU performs serial code, and the GPU performs parallel code. Because RBC does not need the same huge amount of storage as an absorbing boundary, RTM becomes practically applicable for 3D VSP imaging.

show abstract

Reverse time migration with random boundaries

Cited by 130 publications

References 10 publications

Efficient and stable extrapolation of prestack wavefields

Efficient and stable extrapolation of prestack wavefields

Closing the performance gap between an iterative frequency-domain solver and an explicit time-domain scheme for 3D migration on parallel architectures

Reverse time migration of 3D vertical seismic profile data

Contact Info

Product

Resources

About