# An efficient ADER discontinuous Galerkin scheme for directly solving Hamilton-Jacobi equation

## TL;DR

This paper introduces an efficient one-stage ADER discontinuous Galerkin scheme for directly solving Hamilton-Jacobi equations, achieving high order accuracy in space and time with improved computational efficiency over traditional multi-stage methods.

## Contribution

The paper develops a novel ADER-DG scheme using a local spacetime Galerkin predictor, eliminating the need for multi-stage time discretization in Hamilton-Jacobi equations.

## Key findings

- Achieves high order accuracy in space and time.
- Demonstrates improved computational efficiency.
- Provides explicit formulas for third-order scheme.

## Abstract

This paper proposes an efficient ADER (Arbitrary DERivatives in space and time) discontinuous Galerkin (DG) scheme to directly solve the Hamilton-Jacobi equation. Unlike multi-stage Runge-Kutta methods used in the Runge-Kutta DG (RKDG) schemes, the ADER scheme is one-stage in time discretization, which is desirable in many applications. The ADER scheme used here relies on a local continuous spacetime Galerkin predictor instead of the usual Cauchy-Kovalewski procedure to achieve high order accuracy both in space and time. In such predictor step, a local Cauchy problem in each cell is solved based on a weak formulation of the original equations in spacetime. The resulting spacetime representation of the numerical solution provides the temporal accuracy that matches the spatial accuracy of the underlying DG solution. The scheme is formulated in the modal space and the volume integral and the numerical fluxes at the cell interfaces can be explicitly written. The explicit formulas of the scheme at third order is provided on two-dimensional structured meshes. The computational complexity of the ADER-DG scheme is compared to that of the RKDG scheme. Numerical experiments are also provided to demonstrate the accuracy and efficiency of our scheme.