activity
20112022
most citedA patchy Dynamic Programming scheme for a class of Hamilton-Jacobi-Bellman equations

57 citations · 143 across the 21 of their papers we have counts for

collaborators
Showing 2013 · math.NAShow all

3 papers · 2 filters

math.NA2013★ 16 cited

A semi-Lagrangian scheme for the game -Laplacian via -averaging

M. Falcone, S. Finzi Vita, T. Giorgi +1

We present and analyze an approximation scheme for the two-dimensional game -Laplacian in the framework of viscosity solutions. The approximation is based on a semi-Lagrangian s…

math.NA2013

An approximation scheme for an Eikonal Equation with discontinuous coefficient

Adriano Festa, Maurizio Falcone

We consider the stationary Hamilton-Jacobi equation where the dynamics can vanish at some points, the cost function is strictly positive and is allowed to be discontinuous. More pr…

math.NA2013★ 24 cited

Can local single-pass methods solve any stationary Hamilton-Jacobi-Bellman equation?

Simone Cacace, Emiliano Cristiani, Maurizio Falcone

The use of local single-pass methods (like, e.g., the Fast Marching method) has become popular in the solution of some Hamilton-Jacobi equations. The prototype of these equations i…