International audienceThe goal of this paper is to study some numerical approximations of particular Hamilton-Jacobi-Bellman equations in dimension 1 and with possibly discontinuous initial data. We investigate two anti-diffusive numerical schemes, the first one is based on the Ultra-Bee scheme and the second one is based on the Fast Marching Method. We prove the convergence and derive $L^1$-error estimates for both schemes. We also provide numerical examples to validate their accuracy in solving smooth and discontinuous solutions
A general method for constructing high-order approximation schemes for Hamilton-Jacobi-Bellman equat...
International audienceWe propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to ...
A general method for constructing high-order approximation schemes for Hamilton-Jacobi-Bellman equat...
International audienceThe goal of this paper is to study some numerical approximations of particular...
International audienceThe goal of this paper is to study some numerical approximations of particular...
The goal of this paper is to study some numerical approximations of particular Hamilton-Jacobi-Bellm...
International audienceOn étudie un schéma non monotone pour l'équation Hamilton Jacobi Bellman du pr...
International audienceOn étudie un schéma non monotone pour l'équation Hamilton Jacobi Bellman du pr...
We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellm...
We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approx...
International audienceWe propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to ...
We present a semi-Lagrangian scheme for the approximation of a class of Hamilton- Jacobi-Bellman (HJ...
International audienceWe propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to ...
28 pagesWe study semi-Lagrangian discontinuous Galerkin (SLDG) andRunge-Kutta discontinuous Galerkin...
We extend the theory of Barles Jakobsen [3] for a class of almost monotone schemes to solve stationa...
A general method for constructing high-order approximation schemes for Hamilton-Jacobi-Bellman equat...
International audienceWe propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to ...
A general method for constructing high-order approximation schemes for Hamilton-Jacobi-Bellman equat...
International audienceThe goal of this paper is to study some numerical approximations of particular...
International audienceThe goal of this paper is to study some numerical approximations of particular...
The goal of this paper is to study some numerical approximations of particular Hamilton-Jacobi-Bellm...
International audienceOn étudie un schéma non monotone pour l'équation Hamilton Jacobi Bellman du pr...
International audienceOn étudie un schéma non monotone pour l'équation Hamilton Jacobi Bellman du pr...
We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellm...
We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approx...
International audienceWe propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to ...
We present a semi-Lagrangian scheme for the approximation of a class of Hamilton- Jacobi-Bellman (HJ...
International audienceWe propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to ...
28 pagesWe study semi-Lagrangian discontinuous Galerkin (SLDG) andRunge-Kutta discontinuous Galerkin...
We extend the theory of Barles Jakobsen [3] for a class of almost monotone schemes to solve stationa...
A general method for constructing high-order approximation schemes for Hamilton-Jacobi-Bellman equat...
International audienceWe propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to ...
A general method for constructing high-order approximation schemes for Hamilton-Jacobi-Bellman equat...