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

Unified elimination of 1D acoustic multiple reflection

Abstract: Migration, velocity and amplitude analysis are the employed processing steps to find the desired subsurface information from seismic reflection data. The presence of freesurface and internal multiples can mask the primary reflections for which many processing methods are built. The ability to separate primary from multiple reflections is desirable. Connecting Marchenko theory with classical one-dimensional inversion methods allows to understand the process of multiple reflection elimination as a datafiltering … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4
1
1

Relationship

4
2

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 69 publications
0
5
0
Order By: Relevance
“…As can be learned from the black curve in Figure 3(b), matrix A has full rank, and hence can be inverted. When we apply singular value decomposition A = UΣV t and define the pseudo inverse as A ‡ = VΣ ‡ U t (where Σ ‡ contains the reciprocals of all non-zero singular values), we may now write F m = A ‡ B. Akin to the acoustic Marchenko problem, a range of alternative solvers might be used to compute the pseudo inverse [32,33].…”
Section: Joint System Of Equationsmentioning
confidence: 99%
“…As can be learned from the black curve in Figure 3(b), matrix A has full rank, and hence can be inverted. When we apply singular value decomposition A = UΣV t and define the pseudo inverse as A ‡ = VΣ ‡ U t (where Σ ‡ contains the reciprocals of all non-zero singular values), we may now write F m = A ‡ B. Akin to the acoustic Marchenko problem, a range of alternative solvers might be used to compute the pseudo inverse [32,33].…”
Section: Joint System Of Equationsmentioning
confidence: 99%
“…the direct-wave approximation), the coda F U m can be resolved from ( 17) by linear inversion. A common strategy for the inversion is to rewrite the equation by a Neumann series expansion, which is guaranteed (at least in 1D for infinite frequency content) to converge as long as the spectral radius of operator R U is less than one [31], [34]. However, a variety of alternative numerical solvers might be employed [31], [34], [35], [36].…”
Section: Marchenko Equation For Reflection Datamentioning
confidence: 99%
“…A common strategy for the inversion is to rewrite the equation by a Neumann series expansion, which is guaranteed (at least in 1D for infinite frequency content) to converge as long as the spectral radius of operator R U is less than one [31], [34]. However, a variety of alternative numerical solvers might be employed [31], [34], [35], [36]. For the construction of operator R U , we require access to a complete, well-sampled reflection response [37], [38] and sufficient aperture [39].…”
Section: Marchenko Equation For Reflection Datamentioning
confidence: 99%
“…As indicated by the black curve in Figure 3b, matrix A has full rank, and hence can be inverted. When we apply singular-value decomposition A = UΣV t and define the pseudo-inverse as A ‡ = VΣ ‡ U t (where Σ ‡ contains the reciprocals of all non-zero singular values), we may now write F m = A ‡ B. Akin to the acoustic Marchenko problem, a range of alternative solvers can be used to compute the pseudo-inverse [40,41].…”
Section: Joint System Of Equationsmentioning
confidence: 99%