4.6 Article

Fast sweeping algorithms for a class of Hamilton-Jacobi equations

Journal

SIAM JOURNAL ON NUMERICAL ANALYSIS
Volume 41, Issue 2, Pages 673-694

Publisher

SIAM PUBLICATIONS
DOI: 10.1137/S0036142901396533

Keywords

Hamilton-Jacobi equations; fast marching; fast sweeping; upwind finite differencing; eikonal equations

Ask authors/readers for more resources

We derive a Godunov-type numerical flux for the class of strictly convex, homogeneous Hamiltonians that includes H(p, q) = root ap(2) + bq(2) - 2cpq, c(2) < ab. We combine our Godunov numerical fluxes with simple Gauss - Seidel- type iterations for solving the corresponding Hamilton-Jacobi (HJ) equations. The resulting algorithm is fast since it does not require a sorting strategy as found, e. g., in the fast marching method. In addition, it provides a way to compute solutions to a class of HJ equations for which the conventional fast marching method is not applicable. Our experiments indicate convergence after a few iterations, even in rather difficult cases.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available