A Slowness Matching Eulerian Method for Multivalued Solutions of Eikonal Equations

  • Authors:

  • William W. Symes;Jianliang Qian

  • Affiliations:

  • The Rice Inversion Project, Department of Computational and Applied Mathematics, Rice University, Houston, Texas 77005. symes@caam.rice.edu;Institute for Mathematics and Its Applications, University of Minnesota, 207 Church St. S.E., Minneapolis, Minnesota 55455. qian@ima.umn.edu

  • Venue:
  • Journal of Scientific Computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.03

Visualization

Abstract

Traveltime, or geodesic distance, is locally the solution of the eikonal equation of geometric optics. However traveltime between sufficiently distant points is generically multivalued. Finite difference eikonal solvers approximate only the viscosity solution, which is the smallest value of the (multivalued) traveltime (“first arrival time”). The slowness matching method stitches together local single-valued eikonal solutions, approximated by a finite difference eikonal solver, to approximate all values of the traveltime. In some applications, it is reasonable to assume that geodesics (rays) have a consistent orientation, so that the eikonal equation may be viewed as an evolution equation in one of the spatial directions. This paraxial assumption simplifies both the efficient computation of local traveltime fields and their combination into global multivalued traveltime fields via the slowness matching algorithm. The cost of slowness matching is on the same order as that of a finite difference solver used to compute the viscosity solution, when traveltimes from many point sources are required as is typical in seismic applications. Adaptive gridding near the source point and a formally third order scheme for the paraxial eikonal combine to give second order convergence of the traveltime branches.