Construction of simple, stable and convergent high order schemes for steady first order Hamilton Jacobi equations. - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Reports (Research Report) Year : 2006

Construction of simple, stable and convergent high order schemes for steady first order Hamilton Jacobi equations.

Abstract

We develop a very simple algorithm that permits to construct compact, high order schemes for steady first order Hamilton Jacobi equations. The algorithm relies on the blending of a first order scheme and a compact high order one. The blending is conducted in such a way that the scheme is formally high order accurate. A convergence proof is given. We provide several numerical illustrations that demonstrate the effective accuracy of the scheme. The numerical examples use triangular unstructured meshes, but our method may be applied to other kind of meshes. Several implementation remarks are also given.
Fichier principal
Vignette du fichier
rapport.pdf (761.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00114888 , version 1 (18-11-2006)
inria-00114888 , version 2 (06-12-2006)
inria-00114888 , version 3 (07-12-2006)
inria-00114888 , version 4 (07-12-2006)

Identifiers

  • HAL Id : inria-00114888 , version 3

Cite

Remi Abgrall. Construction of simple, stable and convergent high order schemes for steady first order Hamilton Jacobi equations.. [Research Report] 2006, pp.34. ⟨inria-00114888v3⟩
68 View
248 Download

Share

Gmail Facebook X LinkedIn More