Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations
type: Item
instance of: scholarly article
title: Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations
zbMATH Open document ID: 1352.65624
author: Miles Detrixhe
author: Frédéric Gibou
published in: Journal of Computational Physics
publication date: 2016-12-20T00:00:00Z
Mathematics Subject Classification ID: 65N55
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 91A25
zbMATH DE Number: 6666871
zbMATH Keywords: parallel computing
zbMATH Keywords: Hamilton-Jacobi
zbMATH Keywords: fast sweeping
zbMATH Keywords: eikonal equation
zbMATH Keywords: optimal control
zbMATH Keywords: dynamic games
MaRDI profile type: Publication
full work available at URL: j.jcp.2016.06.023
OpenAlex ID: W2472583304
cites work: Fast Marching Methods for Stationary Hamilton–Jacobi Equations with Axis-Aligned Anisotropy
cites work: Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
cites work: Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control
cites work: An adaptive domain-decomposition technique for parallelization of the fast marching method
cites work: The eikonal equation: some results applicable to computer vision
cites work: Fast two-scale methods for eikonal equations
cites work: A Parallel Two-Scale Method for Eikonal Equations
cites work: Lax-Friedrichs fast sweeping methods for steady state problems for hyperbolic conservation laws
cites work: Fast Semi-Lagrangian Schemes for the Eikonal Equation and Applications
cites work: A note on two problems in connexion with graphs
cites work: Fast sweeping methods for hyperbolic systems of conservation laws at steady state
cites work: Fully-Discrete Schemes for the Value Function of Pursuit-Evasion Games with State Constraints
cites work: A Fast Iterative Method for Eikonal Equations
cites work: Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations
cites work: Fast Sweeping Methods for Static Hamilton--Jacobi Equations
cites work: Computing geodesic paths on manifolds
cites work: Optimal algorithm for shape from shading and path planning
cites work: Q4109239
cites work: Level set methods and dynamic implicit surfaces
cites work: A Level Set Formulation for the Solution of the Dirichlet Problem for Hamilton–Jacobi Equations
cites work: A fast sweeping method for static convex Hamilton-Jacobi equations
cites work: A Viscosity Solutions Approach to Shape-From-Shading
cites work: A fast marching level set method for monotonically advancing fronts.
cites work: Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
cites work: Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
cites work: Efficient algorithms for globally optimal trajectories
cites work: A fast sweeping method for Eikonal equations
DOI: 10.1016/J.JCP.2016.06.023
description: scientific article; zbMATH DE number 6666871