AN EFFICIENT ADER DISCONTINUOUS GALERKIN SCHEME FOR DIRECTLY SOLVING HAMILTON-JACOBI EQUATION

被引:3
|
作者
Duan, Junming [1 ,2 ]
Tang, Huazhong [1 ,2 ,3 ]
机构
[1] Peking Univ, Sch Math Sci, HEDPS, CAPT, Beijing 100871, Peoples R China
[2] Peking Univ, Sch Math Sci, LMAM, Beijing 100871, Peoples R China
[3] Xiangtan Univ, Sch Math & Computat Sci, Xiangtan 411105, Peoples R China
基金
中国国家自然科学基金;
关键词
Hamilton-Jacobi equation; ADER; Discontinuous Galerkin methods; Local continuous spacetime Galerkin predictor; High order accuracy; FINITE-ELEMENT-METHOD; HIGH-ORDER; VOLUME SCHEMES; WENO SCHEMES; IMPLEMENTATION; MESHES; SPEED;
D O I
10.4208/jcm.1902-m2018-0189
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 formulae 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.
引用
收藏
页码:58 / 83
页数:26
相关论文
共 50 条