High Order Numerical Discretization for Hamilton–Jacobi Equations on Triangular Meshes

  • Authors:

  • Steeve Augoula;Rémi Abgrall

  • Affiliations:

  • Mathématiques Appliquées de Bordeaux, Université de Bordeaux I, 351 Cours de la Libération, 33 405 Talence Cedex, France. augoula@math.u-bordeaux.fr;Mathématiques Appliquées de Bordeaux, Université de Bordeaux I, 351 Cours de la Libération, 33 405 Talence Cedex, France. abgrall@math.u-bordeaux.fr

  • Venue:
  • Journal of Scientific Computing
  • Year:
  • 2000

Quantified Score

Hi-index 0.03

Visualization

Abstract

In this paper we construct several numerical approximations for first order Hamilton–Jacobi equations on triangular meshes. We show that, thanks to a filtering procedure, the high order versions are non-oscillatory in the sense of satisfying the maximum principle. The methods are based on the first order Lax–Friedrichs scheme [2] which is improved here adjusting the dissipation term. The resulting first order scheme is ϵ-monotonic (we explain the expression in the paper) and converges to the viscosity solution as {\cal O}(\sqrt{\Delta t}) for the L∞-norm. The first high order method is directly inspired by the ENO philosophy in the sense where we use the monotonic Lax–Friedrichs Hamiltonian to reconstruct our numerical solutions. The second high order method combines a spatial high order discretization with the classical high order Runge–Kutta algorithm for the time discretization. Numerical experiments are performed for general Hamiltonians and L1, L2 and L∞-errors with convergence rates calculated in one and two space dimensions show the k-th order rate when piecewise polynomial of degree k functions are used, measured in L1-norm.