Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
SIAM Review
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Level set methods: an overview and some recent results
Journal of Computational Physics
SIAM Journal on Numerical Analysis
Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
SIAM Journal on Numerical Analysis
Fast Sweeping Methods for Static Hamilton--Jacobi Equations
SIAM Journal on Numerical Analysis
Journal of Computational Physics
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
A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations
Journal of Scientific Computing
Fast Marching Methods for Stationary Hamilton-Jacobi Equations with Axis-Aligned Anisotropy
SIAM Journal on Numerical Analysis
Some Improvements for the Fast Sweeping Method
SIAM Journal on Scientific Computing
Hi-index | 0.00 |
We define a 驴-causal discretization of static convex Hamilton-Jacobi Partial Differential Equations (HJ PDEs) such that the solution value at a grid node is dependent only on solution values that are smaller by at least 驴. We develop a Monotone Acceptance Ordered Upwind Method (MAOUM) that first determines a consistent, 驴-causal stencil for each grid node and then solves the discrete equation in a single-pass through the nodes. MAOUM is suited to solving HJ PDEs efficiently on highly-nonuniform grids, since the stencil size adjusts to the level of grid refinement. MAOUM is a Dijkstra-like algorithm that computes the solution in increasing value order by using a heap to sort proposed node values. If 驴0, MAOUM can be converted to a Dial-like algorithm that sorts and accepts values using buckets of width 驴. We present three hierarchical criteria for 驴-causality of a node value update from a simplex of nodes in the stencil.The asymptotic complexity of MAOUM is found to be $\mathcal {O}((\hat{\Psi}\rho )^{d} N \log N)$ , where d is the dimension, $\hat{\Psi}$ is a measure of anisotropy in the equation, and 驴 is a measure of the degree of nonuniformity in the grid. This complexity is a constant factor $(\hat{\Psi}\rho)^{d}$ greater than that of the Dijkstra-like Fast Marching Method, but MAOUM solves a much more general class of static HJ PDEs. Although 驴 factors into the asymptotic complexity, experiments demonstrate that grid nonuniformity does not have a large effect on the computational cost of MAOUM in practice. Our experiments indicate that, due to the stencil initialization overhead, MAOUM performs similarly or slightly worse than the comparable Ordered Upwind Method presented in (Sethian and Vladimirsky, SIAM J. Numer. Anal. 41:323, 2003) for two examples on uniform meshes, but considerably better for an example with rectangular speed profile and significant grid refinement around nonsmooth parts of the solution. We test MAOUM on a diverse set of examples, including seismic wavefront propagation and robotic navigation with wind and obstacles.