Test-beds and applications for apparent horizon finders in numerical relativity
M. Alcubierre, S. Brandt, B. Bruegmann, C. Gundlach, J. Masso, E. Seidel, P. Walker
TL;DR
The paper tackles the robust detection of apparent horizons in 3D numerical relativity by deploying three independent horizon finders (axisymmetric, 3D minimization, and 3D fast flow) across a broad suite of test spacetimes, including toy bowl geometries, time-symmetric and non-time-symmetric black-hole data, and Brill wave initial data. It formalizes the local horizon condition via the expansion $H$, develops and compares different numerical strategies for solving $H=0$ on complex surfaces, and demonstrates that some previously published results were incorrect by applying cross-checks among the three methods. The study provides detailed, quantitative benchmarks (critical separations, horizon areas, ADM masses) and shows strong cross-method agreement in many cases while also revealing where and why particular algorithms may fail, especially near horizon formation. The findings lay groundwork for robust horizon finding in evolutions, inform the selection of AHFs for AHBC implementations, and offer valuable validation data for the wider numerical relativity community. The work thus advances the reliability and utility of horizon finding as a tool for exploring black-hole dynamics and gravitational-wave spacetimes in numerical simulations.
Abstract
We present a series of test beds for numerical codes designed to find apparent horizons. We consider three apparent horizon finders that use different numerical methods: one of them in axisymmetry, and two fully three-dimensional. We concentrate first on a toy model that has a simple horizon structure, and then go on to study single and multiple black hole data sets. We use our finders to look for apparent horizons in Brill wave initial data where we discover that some results published previously are not correct. For pure wave and multiple black hole spacetimes, we apply our finders to survey parameter space, mapping out properties of interesting data sets for future evolutions.
