Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations

Abstract : In this paper we present a generalization of the Fast Marching method introduced by J. A. Sethian in 1996 to solve numerically the eikonal equation. The new method, named Buffered Fast Marching (BFM), is based on a semi-Lagrangian discretization and is suitable for Hamilton-Jacobi equations modeling monotonically advancing fronts, including Hamilton-Jacobi-Bellman and Hamilton-Jacobi- Isaacs equations which arise in the framework of optimal control problems and differential games. We also show the convergence of the algorithm to the viscosity solution. Finally we present several numerical tests proving that the BFM method is accurate and faster than the classical iterative algorithm in which every node of the grid is computed at every iteration.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/inria-00258775
Contributor : Emiliano Cristiani <>
Submitted on : Monday, February 25, 2008 - 11:51:46 AM
Last modification on : Wednesday, July 3, 2019 - 10:48:04 AM
Long-term archiving on: : Thursday, May 20, 2010 - 11:30:52 PM

File

BFM_14_sbmtd.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00258775, version 1

Collections

Citation

Emiliano Cristiani. A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations. 2008. ⟨inria-00258775⟩

Share

Metrics

Record views

246

Files downloads

999