vix.ing · top · new · best · stats

A fast sweeping method for Eikonal equations

2004/05/21 by Hongkai Zhao · 898 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Algorithm #Computer science #Mathematics #Matrix Theory and Algorithms #Numerical Methods and Algorithms

paper · pdf · doi:10.1090/s0025-5718-04-01678-3

published in Mathematics of Computation 74(250), 603-627 (American Mathematical Society (AMS))

crossref issued 2004/05/21 · crossref published 2004/05/21 · crossref published-online 2004/05/21 · openalex publication_date 2004/05/21 · crossref created 2005/01/14 · openalex created_date 2025/10/10 · crossref deposited 2026/04/21 · openalex updated_date 2026/08/05 · crossref indexed 2026/08/08

Abstract

In this paper a fast sweeping method for computing the numerical solution of Eikonal equations on a rectangular grid is presented. The method is an iterative method which uses upwind difference for discretization and uses Gauss-Seidel iterations with alternating sweeping ordering to solve the discretized system. The crucial idea is that each sweeping ordering follows a family of characteristics of the corresponding Eikonal equation in a certain direction simultaneously. The method has an optimal complexity of O ( N ) O(N) for N N grid points and is extremely simple to implement in any number of dimensions. Monotonicity and stability properties of the fast sweeping algorithm are proven. Convergence and error estimates of the algorithm for computing the distance function is studied in detail. It is shown that 2 n 2n Gauss-Seidel iterations is enough for the distance function in n n dimensions. An estimation of the number of iterations for general Eikonal equations is also studied. Numerical examples are used to verify the analysis.

Cited by

Related