Revisiting the apparent horizon finding problem with multigrid methods
Hon-Ka Hui, Lap-Ming Lin

TL;DR
This paper introduces a multigrid-based algorithm for locating apparent horizons in numerical relativity, demonstrating comparable accuracy and improved speed at high resolutions over existing methods, with greater flexibility in initial guesses.
Contribution
The paper develops a multigrid algorithm for apparent horizon finding that works without symmetries and outperforms existing methods at high resolutions.
Findings
Performs comparably to AHFinderDirect in accuracy.
Outperforms AHFinderDirect in speed at high resolutions.
More flexible with initial guesses than Newton-based methods.
Abstract
Apparent horizon plays an important role in numerical relativity as it provides a tool to characterize the existence and properties of black holes on three-dimensional spatial slices in 3+1 numerical spacetimes. Apparent horizon finders based on different techniques have been developed. In this paper, we revisit the apparent horizon finding problem in numerical relativity using multigrid-based algorithms. We formulate the nonlinear elliptic apparent horizon equation as a linear Poisson-type equation with a nonlinear source, and solve it using a multigrid algorithm with Gauss-Seidel line relaxation. A fourth order compact finite difference scheme in spherical coordinates is derived and employed to reduce the complexity of the line relaxation operator to a tri-diagonal matrix inversion. The multigrid-based apparent horizon finder developed in this work is capable of locating apparent…
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.
Taxonomy
TopicsGeophysics and Gravity Measurements · Solar Radiation and Photovoltaics
