SearcharxivSearch

arXiv subjects

Nathaniel Indik

Publications and source records attributed to Nathaniel Indik.

2 recordsLinked to original sources

Reducing the number of templates for aligned-spin compact binary coalescence gravitational wave searches using metric-agnostic template nudging

Efficient multi-dimensional template placement is crucial in computationally intensive matched-filtering searches for Gravitational Waves (GWs). Here, we implement the Neighboring Cell Algorithm (NCA) to improve the detection volume of an existing Compact Binary Coalescence (CBC) template bank. This algorithm has already been successfully applied for a binary millisecond pulsar search in data from the Fermi satellite. It repositions templates from over-dense regions to under-dense regions and reduces the number of templates that would have been required by a stochastic method to achieve the same detection volume. Our method is readily generalizable to other CBC parameter spaces. Here we apply this method to the aligned--single-spin neutron-star--black-hole binary coalescence inspiral-merger-ringdown gravitational wave parameter space. We show that the template nudging algorithm can attain the equivalent effectualness of the stochastic method with 12% fewer templates.

gr-qc

A stochastic template bank for gravitational wave searches for precessing neutron-star--black-hole coalescence events

Gravitational wave searches to date have largely focused on non-precessing systems. Including precession effects greatly increases the number of templates to be searched over. This leads to a corresponding increase in the computational cost and can increase the false alarm rate of a realistic search. On the other hand, there might be astrophysical systems that are entirely missed by non-precessing searches. In this paper we consider the problem of constructing a template bank using stochastic methods for neutron-star--black-hole binaries allowing for precession, but with the restrictions that the orientation of the total angular momentum of the binary is pointing towards the detector and that the neutron-star spin is negligible relative to that of the black-hole. We quantify the number of templates required for the search, and we explicitly construct the template bank. We show that despite the large number of templates, stochastic methods can be adapted to solve the problem. We quantify the parameter space region over which the non-precessing search might miss signals.

gr-qc