Event and apparent horizon finders for 3+1 numerical relativity

From MaRDI portal
Publication:883207

DOI10.12942/LRR-2007-3zbMATH Open1116.83001arXivgr-qc/0512169OpenAlexW2166590684WikidataQ47163635 ScholiaQ47163635MaRDI QIDQ883207FDOQ883207


Authors: Jonathan Thornburg Edit this on Wikidata


Publication date: 1 June 2007

Published in: Living Reviews in Relativity (Search for Journal in Brave)

Abstract: Event and apparent horizons are key diagnostics for the presence and properties of black holes. In this article I review numerical algorithms and codes for finding event and apparent horizons in numerically-computed spacetimes, focusing on calculations done using the 3+1 ADM formalism. There are 3 basic algorithms for finding event horizons, based respectively on integrating null geodesics emph{forwards} in time, integrating null geodesics emph{backwards} in time, and integrating null emph{surfaces} backwards in time. The last of these is generally the most efficient and accurate. There are a large number of apparent-horizon finding algorithms, with differing trade-offs between speed, robustness, accuracy, and ease of programming. In axisymmetry, shooting algorithms work well and are fairly easy to program. In slices with no continuous symmetries, Nakamura et al.'s algorithm and elliptic-PDE algorithms are fast and accurate, but require good initial guesses to converge. In many cases Schnetter's "pretracking" algorithm can greatly improve an elliptic-PDE algorithm's robustness. Flow algorithms are generally quite slow, but can be very robust in their convergence.


Full work available at URL: https://arxiv.org/abs/gr-qc/0512169




Recommendations



Cites Work


Cited In (27)

Uses Software





This page was built for publication: Event and apparent horizon finders for \(3+1\) numerical relativity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883207)