Minimum traveltime calculation in 3-D graph theory

Geophysics ◽  
1996 ◽  
Vol 61 (6) ◽  
pp. 1895-1898 ◽  
Author(s):  
Ningya Cheng ◽  
Leigh House

Traveltime calculation is a crucial part of seismic migration schemes, especially prestack migration. There are many different ways to compute traveltimes. These methods can be divided into three categories: (1) Ray tracing (Julian and Gubbins, 1977; Červený et al., 1977). These treat the problem as a initial value problem by shooting rays from the source to the receivers. Or they can also treat the problem as a two‐point boundary value problem. An initial raypath is bent using perturbation theory until Fermat’s principle is satisfied. Nichols (1994) also computed traveltimes with the amplitude information attached to it in two dimensions. (2) Finite‐difference methods (Reshel and Kosloff, 1986; Vidale, 1988; van Trier and Symes, 1991). These solve the eikonal equation directly by using different numerical schemes such as the Runge‐Kutta method, wavefront expansion, or upwind finite difference. (3) Graph theory (Moser, 1991; Fisher and Lees, 1993; Meng et al. 1994). This method recasts the traveltime problem into a shortest path search over a network, which is constructed from the velocity model. This method is guaranteed to find a stable minimum traveltime with any velocity model.

2015 ◽  
Vol 17 (2) ◽  
pp. 317-336 ◽  
Author(s):  
Wei Wang ◽  
Chi-Wang Shu ◽  
H.C. Yee ◽  
Dmitry V. Kotov ◽  
Björn Sjögreen

AbstractIn this paper, we extend the high order finite-difference method with subcell resolution (SR) in [34] for two-species stiff one-reaction models to multispecies and multireaction inviscid chemical reactive flows, which are significantly more difficult because of the multiple scales generated by different reactions. For reaction problems, when the reaction time scale is very small, the reaction zone scale is also small and the governing equations become very stiff. Wrong propagation speed of discontinuity may occur due to the underresolved numerical solution in both space and time. The present SR method for reactive Euler system is a fractional step method. In the convection step, any high order shock-capturing method can be used. In the reaction step, an ODE solver is applied but with certain computed flow variables in the shock region modified by the Harten subcell resolution idea. Several numerical examples of multispecies and multireaction reactive flows are performed in both one and two dimensions. Studies demonstrate that the SR method can capture the correct propagation speed of discontinuities in very coarse meshes.


Geophysics ◽  
1994 ◽  
Vol 59 (5) ◽  
pp. 844-849 ◽  
Author(s):  
M. Ali Riahi ◽  
Christopher Juhlin

Finite‐difference methods have generally been used to solve dynamic wave propagation problems over the last 25 years (Alterman and Karal, 1968; Boore, 1972; Kelly et al., 1976; and Levander, 1988). Recently, finite‐difference methods have been applied to the eikonal equation to calculate the kinematic solution to the wave equation (Vidale, 1988 and 1990; Podvin and Lecomte, 1991; Van Trier and Symes, 1991; Qin et al., 1992). The calculation of the first‐arrival times using this method has proven to be considerably faster than using classical ray tracing, and problems such as shadow zones, multipathing, and barrier penetration are easily handled. Podvin and Lecomte (1991) and Matsuoka and Ezaka (1992) extended and expanded upon Vidale’s (1988) algorithm to calculate traveltimes for reflected waves in two dimensions. Based on finite‐difference calculations for first‐arrival times, Hole et al. (1992) devised a scheme for inverting synthetic and real data to estimate the depth to refractors in the crust in three dimensions. The method of Hole et al. (1992) for inversion is computationally efficient since it avoids the matrix inversion of many of the published schemes for refraction and reflection traveltime data (Gjøystdal and Ursin, 1981).


Robotica ◽  
2021 ◽  
pp. 1-12
Author(s):  
Xu-Qian Fan ◽  
Wenyong Gong

Abstract Path planning has been widely investigated by many researchers and engineers for its extensive applications in the real world. In this paper, a biharmonic radial basis potential function (BRBPF) representation is proposed to construct navigation fields in 2D maps with obstacles, and it therefore can guide and design a path joining given start and goal positions with obstacle avoidance. We construct BRBPF by solving a biharmonic equation associated with distance-related boundary conditions using radial basis functions (RBFs). In this way, invalid gradients calculated by finite difference methods in large size grids can be preventable. Furthermore, paths constructed by BRBPF are smoother than paths constructed by harmonic potential functions and other methods, and plenty of experimental results demonstrate that the proposed method is valid and effective.


Sign in / Sign up

Export Citation Format

Share Document