Fast sweeping method for the factored eikonal equation

Authors:
Sergey Fomel;Songting Luo;Hongkai Zhao
Affiliations:
Jackson School of Geosciences, The University of Texas at Austin, Austin, TX 78713, United States;Department of Mathematics, University of California, Irvine, CA 92697, United States;Department of Mathematics, University of California, Irvine, CA 92697, United States
Venue:
Journal of Computational Physics
Year:
2009

Citing 7
Cited 2

Implicit and nonparametric shape reconstruction from unorganized data using a variational level set method

Computer Vision and Image Understanding
Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control

SIAM Journal on Numerical Analysis
Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations

Journal of Computational Physics
Fast Sweeping Methods for Static Hamilton--Jacobi Equations

SIAM Journal on Numerical Analysis
High Order Fast Sweeping Methods for Static Hamilton---Jacobi Equations

Journal of Scientific Computing
A Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations

Journal of Scientific Computing
Fast Sweeping Methods for Eikonal Equations on Triangular Meshes

SIAM Journal on Numerical Analysis

Factored singularities and high-order Lax-Friedrichs sweeping schemes for point-source traveltimes and amplitudes

Journal of Computational Physics
A uniformly second order fast sweeping method for eikonal equations

Journal of Computational Physics

Quantified Score

Hi-index	31.46

Visualization

Abstract

We develop a fast sweeping method for the factored eikonal equation. By decomposing the solution of a general eikonal equation as the product of two factors: the first factor is the solution to a simple eikonal equation (such as distance) or a previously computed solution to an approximate eikonal equation. The second factor is a necessary modification/correction. Appropriate discretization and a fast sweeping strategy are designed for the equation of the correction part. The key idea is to enforce the causality of the original eikonal equation during the Gauss-Seidel iterations. Using extensive numerical examples we demonstrate that (1) the convergence behavior of the fast sweeping method for the factored eikonal equation is the same as for the original eikonal equation, i.e., the number of iterations for the Gauss-Seidel iterations is independent of the mesh size, (2) the numerical solution from the factored eikonal equation is more accurate than the numerical solution directly computed from the original eikonal equation, especially for point sources.