We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimization that is related to the Legendre transform in our sweeping scheme can either be solved analytically or numerically. We illustrate the efficiency and accuracy approach with several numerical examples in 2D and 3D. 1
In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton–Jacobi–Bellman (...
We present a generalization of the Fast Marching (FM) method for the numerical solution of a class o...
International audienceWe present a generalization of the Fast Marching (FM) method for the numerical...
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamilt...
Fast sweeping methods utilize the Gauss-Seidel iterations and alternating sweeping strat-egy to achi...
We propose a simple, fast sweeping method based on the Lax-Friedrichs monotone numerical Hamiltonian...
We present a fast sweeping method for a class of Hamilton-Jacobi equations that arise from time-inde...
Abstract. The fast sweeping method is an efficient iterative method for hyperbolic problems. It comb...
High order fast sweeping methods have been developed recently in the literature to solve static Hami...
The authors develop a family of fast methods approximating the solution to a wide class of static Ha...
The solution of a static Hamilton-Jacobi Partial Differential Equation (HJ PDE) can be used to deter...
We introduce simplex free adaptive tree numerical methods for solv-ing static and time dependent Ham...
22 pagesInternational audienceThe use of local single-pass methods (like, e.g., the Fast Marching me...
Consider the eikonal equation, = 1. If the initial condition is u = 0 on a manifold, then the soluti...
Abstract. The use of local single-pass methods (like, e.g., the Fast Marching method) has become pop...
In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton–Jacobi–Bellman (...
We present a generalization of the Fast Marching (FM) method for the numerical solution of a class o...
International audienceWe present a generalization of the Fast Marching (FM) method for the numerical...
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamilt...
Fast sweeping methods utilize the Gauss-Seidel iterations and alternating sweeping strat-egy to achi...
We propose a simple, fast sweeping method based on the Lax-Friedrichs monotone numerical Hamiltonian...
We present a fast sweeping method for a class of Hamilton-Jacobi equations that arise from time-inde...
Abstract. The fast sweeping method is an efficient iterative method for hyperbolic problems. It comb...
High order fast sweeping methods have been developed recently in the literature to solve static Hami...
The authors develop a family of fast methods approximating the solution to a wide class of static Ha...
The solution of a static Hamilton-Jacobi Partial Differential Equation (HJ PDE) can be used to deter...
We introduce simplex free adaptive tree numerical methods for solv-ing static and time dependent Ham...
22 pagesInternational audienceThe use of local single-pass methods (like, e.g., the Fast Marching me...
Consider the eikonal equation, = 1. If the initial condition is u = 0 on a manifold, then the soluti...
Abstract. The use of local single-pass methods (like, e.g., the Fast Marching method) has become pop...
In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton–Jacobi–Bellman (...
We present a generalization of the Fast Marching (FM) method for the numerical solution of a class o...
International audienceWe present a generalization of the Fast Marching (FM) method for the numerical...