Relativistic MHD with Adaptive Mesh Refinement
Matthew Anderson, Eric Hirschmann, Steven L. Liebling, David Neilsen

TL;DR
This paper introduces a new GRMHD simulation code employing adaptive mesh refinement, demonstrating improved performance and accurate modeling of black hole accretion with scalable parallel computing.
Contribution
A novel GRMHD code utilizing distributed parallel AMR with advanced numerical methods and divergence cleaning, enabling efficient and accurate simulations of relativistic astrophysical phenomena.
Findings
AMR significantly improves computational performance.
The code accurately reproduces the Michel solution for black hole accretion.
Strong scaling results show efficient parallel performance.
Abstract
This paper presents a new computer code to solve the general relativistic magnetohydrodynamics (GRMHD) equations using distributed parallel adaptive mesh refinement (AMR). The fluid equations are solved using a finite difference Convex ENO method (CENO) in 3+1 dimensions, and the AMR is Berger-Oliger. Hyperbolic divergence cleaning is used to control the constraint. We present results from three flat space tests, and examine the accretion of a fluid onto a Schwarzschild black hole, reproducing the Michel solution. The AMR simulations substantially improve performance while reproducing the resolution equivalent unigrid simulation results. Finally, we discuss strong scaling results for parallel unigrid and AMR runs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
