Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
520795 | Journal of Computational Physics | 2011 | 23 Pages |
In this paper, we propose a finite difference AMR-WENO method for hyperbolic conservation laws. The proposed method combines the adaptive mesh refinement (AMR) framework [4] and [5] with the high order finite difference weighted essentially non-oscillatory (WENO) method in space and the total variation diminishing (TVD) Runge–Kutta (RK) method in time (WENO-RK) [18] and [10] by a high order coupling. Our goal is to realize mesh adaptivity in the AMR framework, while maintaining very high (higher than second) order accuracy of the WENO-RK method in the finite difference setting. The high order coupling of AMR and WENO-RK is accomplished by high order prolongation in both space (WENO interpolation) and time (Hermite interpolation) from coarse to fine grid solutions, and at ghost points. The resulting AMR-WENO method is accurate, robust and efficient, due to the mesh adaptivity and very high order spatial and temporal accuracy. We have experimented with both the third and the fifth order AMR-WENO schemes. We demonstrate the accuracy of the proposed scheme using smooth test problems, and their quality and efficiency using several 1D and 2D nonlinear hyperbolic problems with very challenging initial conditions. The AMR solutions are observed to perform as well as, and in some cases even better than, the corresponding uniform fine grid solutions. We conclude that there is significant improvement of the fifth order AMR-WENO over the third order one, not only in accuracy for smooth problems, but also in its ability in resolving complicated solution structures, due to the very low numerical diffusion of high order schemes. In our work, we found that it is difficult to design a robust AMR-WENO scheme that is both conservative and high order (higher than second order), due to the mass inconsistency of coarse and fine grid solutions at the initial stage in a finite difference scheme. Resolving these issues as well as conducting comprehensive evaluation of computational efficiency constitute our future work.