2018
DOI: 10.1093/mnras/sty734
|View full text |Cite
|
Sign up to set email alerts
|

ADER discontinuous Galerkin schemes for general-relativistic ideal magnetohydrodynamics

Abstract: We present a new class of high-order accurate numerical algorithms for solving the equations of general-relativistic ideal magnetohydrodynamics in curved spacetimes. In this paper we assume the background spacetime to be given and static, i.e., we make use of the Cowling approximation. The governing partial differential equations are solved via a new family of fully-discrete and arbitrary high-order accurate path-conservative discontinuous Galerkin (DG) finite-element methods combined with adaptive mesh refine… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
78
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8
2

Relationship

2
8

Authors

Journals

citations
Cited by 53 publications
(84 citation statements)
references
References 123 publications
0
78
0
Order By: Relevance
“…A. A fixed Cartesian mesh made of N P quadrilaterals elements, which is not moved during the simulation, but which can be successively refined, with a general space-tree-type data structure that allows elementby-element refinement with a general refinement factor r ≥ 2, in order to increase the resolution in the areas of interest, as can be seen in Figure 2 (for the details on the refinement procedure we refer to [80,82]). To ease the description of the numerical method, we will associate to each quadrilateral element P n i , a set of indices that refer to its Cartesian coordinates, {j, k}, such that P n jk :…”
Section: Domain Discretizationmentioning
confidence: 99%
“…A. A fixed Cartesian mesh made of N P quadrilaterals elements, which is not moved during the simulation, but which can be successively refined, with a general space-tree-type data structure that allows elementby-element refinement with a general refinement factor r ≥ 2, in order to increase the resolution in the areas of interest, as can be seen in Figure 2 (for the details on the refinement procedure we refer to [80,82]). To ease the description of the numerical method, we will associate to each quadrilateral element P n i , a set of indices that refer to its Cartesian coordinates, {j, k}, such that P n jk :…”
Section: Domain Discretizationmentioning
confidence: 99%
“…Furthermore, in order to increase the resolution in the areas of interest, the ADER-DG scheme described above has been implemented on space-time adaptive Cartesian meshes, with a cell-by-cell refinement approach; for all the details we refer to [44,38,141,47,46,13,140,113].…”
Section: Adaptive Mesh Refinement (Amr)mentioning
confidence: 99%
“…Simulations are run on the domain Ω = [0, 1] × [0, 1] until t = 0.5 using a fourth order ADER-DG scheme [15,16,38] with polynomial approximation degree N = 3 and 100 × 4 spatial elements. A fine grid reference solution is computed with a third order ADER-WENO finite volume scheme [14,16,38] on 1000 cells.…”
Section: Numerical Examplesmentioning
confidence: 99%