1992
DOI: 10.1190/1.1443187
|View full text |Cite
|
Sign up to set email alerts
|

A dynamic programming approach to first arrival traveltime computation in media with arbitrarily distributed velocities

Abstract: Curved‐ray tomographic traveltime inversion, reverse‐time migration and various other seismic modeling applications require the calculation of traveltime and raypath information throughout a two‐ or three‐dimensional medium. When arbitrary velocity distributions and curved rays are involved, traditional ray shooting or bending procedures can be time consuming and error prone. A two‐dimensional dynamic programming traveltime computation technique, based upon Fermat’s principle, uses simple calculus techniques a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
59
0
1

Year Published

2001
2001
2016
2016

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 132 publications
(60 citation statements)
references
References 5 publications
0
59
0
1
Order By: Relevance
“…The forward part of the traveltime tomography was solved by tracing rays through the medium using a finite differences approximation of the eikonal equation (Vidale 1988;Podvin & Lecomte 1991;Schneider et al 1992). Partial derivatives of the calculated traveltimes with respect to the velocity nodes were derived using the techniques described by Lutter et al (1990) and Zelt & Smith (1992).…”
Section: T R Av E Lt I M E T O M O G R a P H Y U S I N G T I P T E Q mentioning
confidence: 99%
“…The forward part of the traveltime tomography was solved by tracing rays through the medium using a finite differences approximation of the eikonal equation (Vidale 1988;Podvin & Lecomte 1991;Schneider et al 1992). Partial derivatives of the calculated traveltimes with respect to the velocity nodes were derived using the techniques described by Lutter et al (1990) and Zelt & Smith (1992).…”
Section: T R Av E Lt I M E T O M O G R a P H Y U S I N G T I P T E Q mentioning
confidence: 99%
“…Other related methods include a dynamic programming approach and post sweeping idea in [15] and a group marching method in [13].…”
Section: A Fast Sweeping Methods For Eikonal Equations 605mentioning
confidence: 99%
“…Some authors proposed algorithms based on ray tracing (Cerveny 1989), while others considered finite-difference approximations to the Eikonal equation (Faria and Stoffa 1994). In this study we followed Faria and Stoffa (1994) and modified the algorithm described by Schneider et al (1992) to yield anisotropic travel times.…”
Section: Anisotropic Travel Time Computationsmentioning
confidence: 99%
“…Curved ray paths may be computed using two-point ray tracing schemes (Zelt and Smith 1992), but in the presence of strong velocity contrasts this may lead to numerical instabilities. A more robust alternative is to compute travel times using a finite-difference approximation to the governing Eikonal equation (Schneider et al 1992) and to reconstruct the ray paths by following the steepest descent of the resulting travel-time fields (Aldrige and Oldenburg 1993).…”
Section: Travel-time Tomographymentioning
confidence: 99%