Fast marching methods for stationary Hamilton-Jacobi equations with axis-aligned anisotropy

DOI10.1137/070680357MaRDI QIDQ5305936zbMATH OpenOpenAlexFDO

Authors Ken Alton, Ian M. Mitchell

Publication date 24 March 2010

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/070680357

zbMATH Keywords

anisotropic optimal controllocal update equation

Mathematics Subject Classification ID

Theoretical approximation in context of PDEs (35A35) Viscosity solutions to PDEs (35D40) Hamilton-Jacobi equations (35F21) Boundary value problems for nonlinear first-order PDEs (35F30) Dynamic programming in optimal control and differential games (49L20) Viscosity solutions to Hamilton-Jacobi equations in optimal control and differential games (49L25) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06)

Recommendations

• Fast Marching Methods
• Some improvements of the fast marching method
• Anisotropic fast-marching on Cartesian grids using lattice basis reduction
• A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
• Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes

Cited in

(14)

• Fast-marching methods for curvature penalized shortest paths
• A rotating-grid upwind fast sweeping scheme for a class of Hamilton-Jacobi equations
• Neighbor-gradient single-pass method for solving anisotropic eikonal equation
• Equivalent extensions of Hamilton-Jacobi-Bellman equations on hypersurfaces
• An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
• Improved characteristic fast marching method for the generalized eikonal equation in a moving medium
• Characteristic fast marching method on triangular grids for the generalized eikonal equation in moving media
• Efficient fast marching with Finsler metrics
• Anisotropic fast-marching on Cartesian grids using lattice basis reduction
• Causal domain restriction for eikonal equations
• Impact of heterogeneity upon the accuracy of the eikonal solution using the fast marching method
• An adaptive domain-decomposition technique for parallelization of the fast marching method
• Efficient and scalable path-planning algorithms for curvature constrained motion in the Hamilton-Jacobi formulation
• Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations

This page was built for publication: Fast marching methods for stationary Hamilton-Jacobi equations with axis-aligned anisotropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305936)