z-logo
open-access-imgOpen Access
Local high-order conservative space-time adaptive mesh refinement with the Runge-Kutta time integration for solving the systems of conservation laws
Author(s) -
Boris Korneev,
V. D. Levchenko,
А. В. Иванов,
Andrey Zakirov
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1740/1/012055
Subject(s) - discretization , conservation law , runge–kutta methods , discontinuous galerkin method , finite volume method , adaptive mesh refinement , boundary (topology) , mathematics , partial differential equation , numerical analysis , numerical integration , boundary value problem , order of accuracy , flow (mathematics) , solver , computer science , divergence (linguistics) , mathematical optimization , numerical stability , finite element method , mathematical analysis , computational science , geometry , physics , mechanics , thermodynamics , linguistics , philosophy
Numerical simulation is widely used as a main way of researching the processes described by the systems of partial differential equations in the divergence form, like fluid dynamics, traffic flow, wave propagation. To obtain desired accuracy and resolution, the high-order numerical methods are used. In this paper we consider the Runge-Kutta (RK) time discretization, when the space discretization can be high-order finite volume method, discontinuous Galerkin method or others. Presence of discrete analogue of conservation is considered to be very important for such methods as it corresponds to the essential feature of simulated process, becoming especially vital at the discontinuous solutions. The adaptive mesh refinement (AMR) techniques are used to get the numerical solution with more resolution where needed. For the explicit numerical scheme obeying the Courant-Friedrichs-Lewy (CFL) condition, the bigger time integration step can be chosen for the coarser cells. The problem is how to reformulate the numerical scheme near the boundary between cells of different size, keeping the conservation and high-order accuracy. In this paper a new algorithm is suggested. The changes in the numerical method are made only in the vicinity of the boundary. The local character of the developed algorithm allows us to efficiently implement it at modern computer systems. Results of validation tests of developed solver are shown.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here