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 is the eikonal equation, for which the methods can be applied saving CPU time and possibly memory allocation. Then some questions naturally arise: Can local single-pass methods solve any Hamilton-Jacobi equation? If not, where should the limit 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 the literature and 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 actually be solved, making local single-pass methods very useful from a practical point of view.

CAN LOCAL SINGLE-PASS METHODS SOLVE ANY STATIONARY HAMILTON-JACOBI-BELLMAN EQUATION? / Cacace, Simone; Cristiani, Emiliano; Falcone, Maurizio. - In: SIAM JOURNAL ON SCIENTIFIC COMPUTING. - ISSN 1064-8275. - STAMPA. - 36:2(2014), pp. 570-587. [10.1137/130907707]

CAN LOCAL SINGLE-PASS METHODS SOLVE ANY STATIONARY HAMILTON-JACOBI-BELLMAN EQUATION?

CACACE, SIMONE;CRISTIANI, Emiliano;FALCONE, Maurizio
2014

Abstract

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 is the eikonal equation, for which the methods can be applied saving CPU time and possibly memory allocation. Then some questions naturally arise: Can local single-pass methods solve any Hamilton-Jacobi equation? If not, where should the limit 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 the literature and 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 actually be solved, making local single-pass methods very useful from a practical point of view.
2014
fast sweeping methods; metodi fast marching; semi-lagrangian schemes; hamilton-jacobi equations; equazioni di hamilton-jacobi; schemi semi-lagrangiani; fast marching methods; eikonal equation
01 Pubblicazione su rivista::01a Articolo in rivista
CAN LOCAL SINGLE-PASS METHODS SOLVE ANY STATIONARY HAMILTON-JACOBI-BELLMAN EQUATION? / Cacace, Simone; Cristiani, Emiliano; Falcone, Maurizio. - In: SIAM JOURNAL ON SCIENTIFIC COMPUTING. - ISSN 1064-8275. - STAMPA. - 36:2(2014), pp. 570-587. [10.1137/130907707]
File allegati a questo prodotto
File Dimensione Formato  
Cacace_postprint_Can-local-single-pass_2014.pdf

accesso aperto

Note: Articolo principale
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 519.79 kB
Formato Adobe PDF
519.79 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/561098
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 12
social impact