The nonconvex multi-dimensional Riemann problem for Hamilton-Jacobi equations
SIAM Journal on Mathematical Analysis
High-order essentially nonsocillatory schemes for Hamilton-Jacobi equations
SIAM Journal on Numerical Analysis
A viscosity solutions approach to shape-from-shading
SIAM Journal on Numerical Analysis
Paraxial eikonal solvers for anisotropic quasi-P travel times
Journal of Computational Physics
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
Journal of Computational Physics
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
Weighted distance maps computation on parametric three-dimensional manifolds
Journal of Computational Physics
Fast Sweeping Methods for Eikonal Equations on Triangular Meshes
SIAM Journal on Numerical Analysis
Journal of Computational Physics
Uniformly Accurate Discontinuous Galerkin Fast Sweeping Methods for Eikonal Equations
SIAM Journal on Scientific Computing
Lax-Friedrichs fast sweeping methods for steady state problems for hyperbolic conservation laws
Journal of Computational Physics
A uniformly second order fast sweeping method for eikonal equations
Journal of Computational Physics
Hi-index | 31.46 |
We propose a new sweeping algorithm which utilizes the Legendre transform of the Hamiltonian on triangulated meshes. The algorithm is a general extension of the previous proposed algorithm by Kao et al. [C.Y. Kao, S.J. Osher, Y.-H. Tsai, Fast sweeping method for static Hamilton-Jacobi equations, SIAM J. Numer. Anal. 42 (2005) 2612-2632]. The algorithm yields the numerical solution at a grid point using only its one-ring neighboring grid values and is easy to implement numerically. The minimization that is related to the Legendre transform in the sweeping algorithm can either be solved analytically or numerically. The scheme is shown to be monotone and consistent. We illustrate the efficiency and accuracy of the new method with several numerical examples in two and three dimensions.