TL;DR
This paper identifies the Kerr separatrix as the zero set of a polynomial, providing a stable numerical method that significantly improves efficiency in locating the last stable orbit in Kerr spacetime, crucial for black hole modeling.
Contribution
The paper demonstrates that the Kerr separatrix can be characterized by a single polynomial and introduces a robust, fast numerical method for its determination.
Findings
The Kerr separatrix is the zero set of a specific polynomial.
The new method achieves approximately 45 times speedup.
Special cases like extreme Kerr and polar orbits are thoroughly analyzed.
Abstract
Black hole spacetimes, like the Kerr spacetime, admit both stable and plunging orbits, separated in parameter space by the separatrix. Determining the location of the separatrix is of fundamental interest in understanding black holes, and is of crucial importance for modeling extreme mass-ratio inspirals. Previous numerical approaches to locating the Kerr separatrix were not always efficient or stable across all of parameter space. In this paper we show that the Kerr separatrix is the zero set of a single polynomial in parameter space. This gives two main results. First, we thoroughly analyze special cases (extreme Kerr, polar orbits, etc.), finding strict bounds on the limits of roots, and unifying a number of results in the literature. Second, we pose a stable numerical method which is guaranteed to quickly and robustly converge to the separatrix. This new approach is implemented in…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
