https://hal.inria.fr/hal-00917270Cacace, SimoneSimoneCacaceSapienza University of Rome - Dipartimento di Matematica "Guido Castelnuovo" [Roma I] - Università degli Studi di Roma "La Sapienza" = Sapienza University [Rome]Cristiani, EmilianoEmilianoCristianiFalcone, MaurizioMaurizioFalconeUniversità degli Studi di Roma "La Sapienza" = Sapienza University [Rome]Can local single-pass methods solve any stationary Hamilton-Jacobi-Bellman equations?HAL CCSD2014[MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA][MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Bouzat, EstelleSensitivity Analysis for Deterministic Controller Design - SADCO - - EC:FP7:PEOPLE2011-01-01 - 2014-12-31 - 264735 - VALID - 2013-12-11 15:39:212021-11-03 14:18:072013-12-11 15:39:21enJournal articles10.1137/1309077071The 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 is the eikonal equation, for which the methods can be applied saving CPU time and possibly memory allocation. Then, some natural questions arise: can local single-pass methods solve any Hamilton-Jacobi equation? If not, where the limit should be set? This paper tries to answer these questions. In order to give a complete picture, we present an overview of some fast methods available in literature and we briefly analyze their main features. We also introduce some numerical tools and provide several numerical tests which are intended to exhibit the limitations of the methods. We show that the construction of a local single-pass method for general Hamilton-Jacobi equations is very hard, if not impossible. Nevertheless, some special classes of problems can be actually solved, making local single-pass methods very useful from the practical point of view.