Marcin Dukalski
Please Note
7 records found
1
Many seismic imaging methods use wavefield extrapolation operators to redatum sources and receivers from the surface into the subsurface. We discuss wavefield extrapolation operators that account for internal multiple reflections, in particular propagator matrices, transfer matrices and Marchenko focusing functions. A propagator matrix is a square matrix that 'propagates' a wavefield vector from one depth level to another. It accounts for primaries and multiples and holds for propagating and evanescent waves. A Marchenko focusing function is a wavefield that focuses at a designated point in space at zero time. Marchenko focusing functions are useful for retrieving the wavefield inside a heterogeneous medium from the reflection response at its surface. By expressing these focusing functions in terms of the propagator matrix, the usual approximations (such as ignoring evanescent waves) are avoided. While a propagator matrix acts on the full wavefield vector, a transfer matrix (according to the definition used in this paper) 'transfers' a decomposed wavefield vector (containing downgoing and upgoing waves) from one depth level to another. It can be expressed in terms of decomposed Marchenko focusing functions. We present propagator matrices, transfer matrices and Marchenko focusing functions in a consistent way and discuss their mutual relations. In the main text we consider the acoustic situation and in the appendices we discuss other wave phenomena. Understanding these mutual connections may lead to new developments of Marchenko theory and its applications in wavefield focusing, Green's function retrieval and imaging.
Much of recent progress in geophysics can be attributed to the adaptation of heterogeneous high-performance computing architectures. It is projected that the next major leap in many areas of science, and hence hopefully in geophysics too, will be due to the emergence of quantum computers. Finding a right combination of hardware, algorithms, and a use case, however, proves to be a very challenging task - especially when looking for a relevant application that scales efficiently on a quantum computer and is difficult to solve using classical means. We find that maximizing stack power for residual statics correction, an NP-hard combinatorial optimization problem, appears to naturally fit a particular type of quantum computing known as quantum annealing. We express the underlying objective function as a quadratic unconstrained binary optimization, which is a quantum-native formulation of the problem. We choose some solution space and define a proper encoding to translate the problem variables into qubit states. We find that these choices can have a significant impact on the maximum problem size that can fit on the quantum annealer and on the fidelity of the final result. To improve the latter, we embed the quantum optimization step in a hybrid classical-quantum workflow, which aims to increase the frequency of finding the global, rather than some local, optimum of the objective function. Finally, we find that a generic, black-box, hybrid classical-quantum solver also could be used to solve stack-power maximization problems proximal to industrial relevance and capable of surpassing deterministic solvers prone to cycle skipping. A custom-built workflow capable of solving larger problems with an even higher robustness and greater control of the user appears to be within reach in the very near future.
Internal multiple elimination
Can we trust an acoustic approximation?