3-D traveltime computation using the fast marching method

摘要: We present a fast algorithm for solving the eikonal equation in three dimensions, based on marching method. The is of order O(N log N), where N total number grid points computational domain. can be used any orthogonal coordinate system and globally constructs solution to each point method unconditionally stable solutions consistent with exact arbitrarily large gradient jumps velocity. In addition, resolves overturning propagation wavefronts. begin mathematical foundation using follow numerical details. then show examples traveltime through SEG/EAGE salt model point-source planewave initial conditions analyze error constant velocity media. allows shape wavefront. While source most commonly condition, plane waves controlled illumination or downward continuation field from one depth another topographic surface another. presented here designed computing first-arrival traveltimes. Nonetheless, since it exploits equation, we believe fastest all possible schemes compute first arrivals.