- Journal Home
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Commun. Comput. Phys., 21 (2017), pp. 423-442.
Published online: 2018-04
Cited by
- BibTex
- RIS
- TXT
In this paper we consider a discontinuous Galerkin discretization of the ideal magnetohydrodynamics (MHD) equations on unstructured meshes, and the divergence free constraint (∇·B = 0) of its magnetic field B. We first present two approaches for maintaining the divergence free constraint, namely the approach of a locally divergence free projection inspired by locally divergence free elements [19], and another approach of the divergence cleaning technique given by Dedner et al. [15]. By combining these two approaches we obtain an efficient method at the almost same numerical cost. Finally, numerical experiments are performed to show the capacity and efficiency of the scheme.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.180515.230616a}, url = {http://global-sci.org/intro/article_detail/cicp/11244.html} }In this paper we consider a discontinuous Galerkin discretization of the ideal magnetohydrodynamics (MHD) equations on unstructured meshes, and the divergence free constraint (∇·B = 0) of its magnetic field B. We first present two approaches for maintaining the divergence free constraint, namely the approach of a locally divergence free projection inspired by locally divergence free elements [19], and another approach of the divergence cleaning technique given by Dedner et al. [15]. By combining these two approaches we obtain an efficient method at the almost same numerical cost. Finally, numerical experiments are performed to show the capacity and efficiency of the scheme.