Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 6, 2022 | public
Journal Article

A high-order shock capturing discontinuous Galerkin-finite difference hybrid method for GRMHD

Abstract

We present a discontinuous Galerkin (DG)–finite difference (FD) hybrid scheme that allows high-order shock capturing with the DG method for general relativistic magnetohydrodynamics. The hybrid method is conceptually quite simple. An unlimited DG candidate solution is computed for the next time step. If the candidate solution is inadmissible, the time step is retaken using robust FD methods. Because of its a posteriori nature, the hybrid scheme inherits the best properties of both methods. It is high-order with exponential convergence in smooth regions, while robustly handling discontinuities. We give a detailed description of how we transfer the solution between the DG and FD solvers, and the troubled-cell indicators necessary to robustly handle slow-moving discontinuities and simulate magnetized neutron stars. We demonstrate the efficacy of the proposed method using a suite of standard and very challenging 1D, 2D, and 3D relativistic magnetohydrodynamics test problems. The hybrid scheme is designed from the ground up to efficiently simulate astrophysical problems such as the inspiral, coalescence, and merger of two neutron stars.

Additional Information

Charm++/Converse [85] was developed by the Parallel Programming Laboratory in the Department of Computer Science at the University of Illinois at Urbana-Champaign. The figures in this article were produced with matplotlib [86, 87], TikZ [88] and ParaView [89, 90]. Computations were performed with the Wheeler cluster at Caltech. This work was supported in part by the Sherman Fairchild Foundation and by NSF Grant Nos. PHY-2011961, PHY-2011968, and OAC-1931266 at Caltech, and NSF Grant Nos. PHY-1912081 and OAC-1931280 at Cornell.

Additional details

Created:
August 22, 2023
Modified:
October 24, 2023