Up-down instability of binary black holes in numerical relativity

Authors: Vijay Varma, Matthew Mould, Davide Gerosa, Mark A. Scheel, Lawrence E. Kidder, Harald P. Pfeiffer

8 pages, 3 figures. Animations available at https://davidegerosa.com/spinprecession

Abstract: Binary black holes with spins that are aligned with the orbital angular momentum do not precess. However, post-Newtonian calculations predict that "up-down" binaries, in which the spin of the heavier (lighter) black hole is aligned (anti-aligned) with the orbital angular momentum, are unstable when the spins are slightly perturbed from perfect alignment. This instability provides a possible mechanism for the formation of precessing binaries in environments where sources are preferentially formed with (anti) aligned spins. In this paper, we confirm the existence of this instability in full numerical relativity using several simulations spanning $\sim 100$ orbits before merger. Initialized with a small perturbation of $1^{\circ}$-$10^{\circ}$, the instability causes a dramatic growth of the spin misalignments, which can reach $\sim 90^{\circ}$ near merger. We show that this leaves a strong imprint on the subdominant modes of the gravitational wave signal, which can potentially be used to distinguish up-down binaries from other sources. Finally, we show that post-Newtonian and effective-one-body approximants are able to reproduce the unstable dynamics of up-down binaries extracted from numerical relativity.

Submitted to arXiv on 13 Dec. 2020

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.