2021
DOI: 10.1111/1365-2478.13151
|View full text |Cite
|
Sign up to set email alerts
|

3D Marchenko applications: implementation and examples

Abstract: We implement the 3D Marchenko equations to retrieve responses to virtual sources inside the subsurface. For this, we require reflection data at the surface of the Earth that contain no free-surface multiples and are densely sampled in space. The required 3D reflection data volume is very large and solving the Marchenko equations requires a significant amount of computational cost. To limit the cost, we apply floating point compression to the reflection data to reduce their volume and the loading time from disk… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 48 publications
0
4
0
Order By: Relevance
“…To this end, Ravasi and Vasconcelos (2021) recently reviewed the challenges associated with such a scenario and proposed a CPU-based distributed implementation that reduces the I/O burden of prior implementations and can perform equally well for both the forward and adjoint. Alternatively, Brackenhoff et al (2021) proposed to use compression techniques, such as the ZFP algorithm (Lindstrom, 2014), to reduce the size of the kernel operator. However, such an approach does not allow matrix-vector operations to be directly applied using the compressed matrix without the need for decompression.…”
Section: Related Workmentioning
confidence: 99%
“…To this end, Ravasi and Vasconcelos (2021) recently reviewed the challenges associated with such a scenario and proposed a CPU-based distributed implementation that reduces the I/O burden of prior implementations and can perform equally well for both the forward and adjoint. Alternatively, Brackenhoff et al (2021) proposed to use compression techniques, such as the ZFP algorithm (Lindstrom, 2014), to reduce the size of the kernel operator. However, such an approach does not allow matrix-vector operations to be directly applied using the compressed matrix without the need for decompression.…”
Section: Related Workmentioning
confidence: 99%
“…The tildes represent plane-wave quantities for focusing functions and Green's functions. The plane-wave focusing functions (Wapenaar et al, 2021;Brackenhoff et al, 2022) are defined by the following integration…”
Section: Theorymentioning
confidence: 99%
“…Further, we have chosen to demonstrate the validity of our workflow for 2D wave propagation only. Various publications have emerged recently on the implementation of the Marchenko equation for 3D wave propagation problems [50], [51], [52]. Building on these developments, we prospect that a 3D implementation of the auxiliary equation should also be feasible.…”
Section: Application To Inverse Source Problemsmentioning
confidence: 99%