An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
DOI10.1007/S10915-011-9512-4zbMATH Open1256.65099OpenAlexW2165609284MaRDI QIDQ2276405FDOQ2276405
Authors: Ken Alton, Ian M. Mitchell 
Publication date: 5 November 2012
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-011-9512-4
Recommendations
- Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
- Ordered upwind methods for static Hamilton–Jacobi equations
- Fast Marching Methods
- Fast marching methods for stationary Hamilton-Jacobi equations with axis-aligned anisotropy
- A fast sweeping method for static convex Hamilton-Jacobi equations
algorithmgrid refinementviscosity solutionanisotropic optimal controlordered upwind methodsrobot navigationanisotropic front propagationdial-like methodsDijkstra-like methodsstatic convex Hamilton-Jacobi equation
Hamilton-Jacobi equations (35F21) Viscosity solutions to Hamilton-Jacobi equations in optimal control and differential games (49L25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- A note on two problems in connexion with graphs
- Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension
- Title not available (Why is that?)
- User’s guide to viscosity solutions of second order partial differential equations
- Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
- Fast Sweeping Methods for Static Hamilton--Jacobi Equations
- Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
- A fast sweeping method for Eikonal equations
- Efficient algorithms for globally optimal trajectories
- A fast marching level set method for monotonically advancing fronts.
- Level set methods: An overview and some recent results
- Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
- Implementation of efficient algorithms for globally optimal trajectories
- Fast Sweeping Methods for Eikonal Equations on Triangular Meshes
- Fast Marching Methods
- Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control
- Label-setting methods for multimode stochastic shortest path problems on graphs
- Computing geodesic paths on manifolds
- Ordered upwind methods for static Hamilton–Jacobi equations
- A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
- A fast sweeping method for static convex Hamilton-Jacobi equations
- Some improvements for the fast sweeping method
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Sequential Minimax Search for a Maximum
- Fast marching methods for stationary Hamilton-Jacobi equations with axis-aligned anisotropy
Cited In (16)
- Single pass computation of first seismic wave travel time in three dimensional heterogeneous media with general anisotropy
- Corner cases, singularities, and dynamic factoring
- Minimal stencils for discretizations of anisotropic PDEs preserving causality or the maximum principle
- Robust shortest path planning and semicontractive dynamic programming
- Control-theoretic models of environmental crime
- Neighbor-gradient single-pass method for solving anisotropic eikonal equation
- Quantifying and Managing Uncertainty in Piecewise-Deterministic Markov Processes
- Ordered upwind methods for static Hamilton–Jacobi equations
- Efficient fast marching with Finsler metrics
- Convergence rate for the ordered upwind method
- Multi-stencils fast marching method for factored eikonal equations with quadratic anisotropy
- Evasive path planning under surveillance uncertainty
- Local minimization algorithms for dynamic programming equations
- Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
- Optimal control with budget constraints and resets
- Riemannian fast-marching on cartesian grids, using Voronoi's first reduction of quadratic forms
Uses Software
This page was built for publication: An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276405)
