Construction of simple, stable and convergent high order schemes for steady first order Hamilton Jacobi equations.
ABGRALL, Remi
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire de Mathématiques Appliquées de Bordeaux [MAB]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire de Mathématiques Appliquées de Bordeaux [MAB]
ABGRALL, Remi
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire de Mathématiques Appliquées de Bordeaux [MAB]
< Leer menos
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire de Mathématiques Appliquées de Bordeaux [MAB]
Idioma
en
Rapport
Este ítem está publicado en
2006p. 34
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Palabras clave
Equation de Hamilton Jacobi Approximation numerique Maillages non structures Probleme stationnaires.
Equation de Hamilton Jacobi Approximation numerique Maillages non structures Probleme stationnaires
Orígen
Importado de HalCentros de investigación