The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Event and Apparent Horizon Finders for 3 + 1 Numerical Relativity
Open accessAbstract
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. The event horizon of an asymptotically-flat spacetime is the boundary between those events from which a future-pointing null geodesic can reach future null infinity and those events from which no such geodesic exists. The event horizon is a (continuous) null surface in spacetime. The event horizon is defined nonlocally in time : it is a global property of the entire spacetime and must be found in a separate post-processing phase after all (or at least the nonstationary part) of spacetime has been numerically computed. There are three basic algorithms for finding event horizons, based on integrating null geodesics forwards in time, integrating null geodesics backwards in time, and integrating null surfaces backwards in time. The last of these is generally the most efficient and accurate. In contrast to an event horizon, an apparent horizon is defined locally in time in a spacelike slice and depends only on data in that slice, so it can be (and usually is) found during the numerical computation of a spacetime. A marginally outer trapped surface (MOTS) in a slice is a smooth closed 2-surface whose future-pointing outgoing null geodesics have zero expansion Θ. An apparent horizon is then defined as a MOTS not contained in any other MOTS. The MOTS condition is a nonlinear elliptic partial differential equation (PDE) for the surface shape, containing the ADM 3-metric, its spatial derivatives, and the extrinsic curvature as coefficients. Most “apparent horizon” finders actually find MOTSs. 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, spectral integral-iteration algorithms 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. Minimization methods are slow and relatively inaccurate in the context of a finite differencing simulation, but in a spectral code they can be relatively faster and more robust.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Large Scale Structure of Space-Time
Hawking, S. W., & Ellis, G. F. R. (1973) · doi:10.1017/cbo9780511524646 · Cited by 10,624
Wald, R. M. (1984) · doi:10.7208/chicago/9780226870373.001.0001 · Cited by 7,188
Republication of: The dynamics of general relativity
Arnowitt, R., Deser, S., & Misner, C. W. (2008) · General Relativity and Gravitation · doi:10.1007/s10714-008-0661-1 · Cited by 2,284
Relativistic Equations for Adiabatic, Spherically Symmetric Gravitational Collapse
Misner, C. W., & Sharp, D. H. (1964) · Physical Review · doi:10.1103/physrev.136.b571 · Cited by 1,700
General relativity without coordinates
Regge, T. (1961) · Il Nuovo Cimento · doi:10.1007/bf02733251 · Cited by 1,477
Cited by
Testing the nature of dark compact objects: a status report
Cardoso, V., & Pani, P. (2019) · Living Reviews in Relativity · doi:10.1007/s41114-019-0020-4 · Cited by 956
Rezzolla, L., & Zanotti, O. (2013) · doi:10.1093/acprof:oso/9780198528906.001.0001 · Cited by 811
Testing black hole candidates with electromagnetic radiation
Bambi, C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.025001 · Cited by 317
The 1965 Penrose singularity theorem
Senovilla, J. M. M., & Garfinkle, D. (2015) · Classical and Quantum Gravity · doi:10.1088/0264-9381/32/12/124008 · Cited by 248
Metadata
- Authors
- Thornburg, J.
- Venue
- Living Reviews in Relativity
- Published
- 2007-06-01
- Volume
- 10
- Issue
- 1
- Pages
- 3-3
- ISSN
- 1433-8351 (ISSN-L)
- 2367-3613
- OpenAlex
- W2166590684
- Cited by
- 164
- References
- 5
- FWCI
- 3.42
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Event and Apparent Horizon Finders for 3 + 1 Numerical Relativity. https://app.cochat.ai/papers/10.12942/lrr-2007-3
- The paper
- Thornburg, J. (2007). Event and Apparent Horizon Finders for 3 + 1 Numerical Relativity. Living Reviews in Relativity. https://doi.org/10.12942/lrr-2007-3
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.