3-D eikonal solvers: first-arrival traveltimes

摘要

The article is concerned with the development and comparison of three different algorithms for the com- putation of first-arrival traveltimes: the fast marching method(FMM), the group marching method(GMM), and a second-order finite-difference eikonal solver. GMM is introduced as a variant of FMM. It proceeds the Solution by advancing a selected group of grid points at a Time, rather than sorting the solution in the narrow band To march forward a single grid point. The second-order Eikonal solver studied in the article is an expanding-box, Essentially nonoscillatory scheme for which the stability Is enforced by the introduction of a down 'n' out march- Ing and a post-sweeping iteration.