Lattice template placement for coherent all-sky searches for gravitational-wave pulsars

TL;DR

This paper presents a practical algorithm for optimally placing templates in all-sky gravitational-wave pulsar searches, significantly reducing computational costs by minimizing the number of templates needed for complete parameter space coverage.

Contribution

The authors introduce a novel template placement algorithm that achieves minimal template count using a lattice approach based on the reduced supersky metric, applicable to various gravitational-wave searches.

Findings

The algorithm ensures complete coverage of the parameter space, including boundaries.

Template count closely matches theoretical estimates and previous predictions.

Applicable to semicoherent searches and known low-mass X-ray binary searches.

Abstract

All-sky, broadband, coherent searches for gravitational-wave pulsars are restricted by limited computational resources. Minimizing the number of templates required to cover the search parameter space, of sky position and frequency evolution, is one important way to reduce the computational cost of a search. We demonstrate a practical algorithm which, for the first time, achieves template placement with a minimal number of templates for an all-sky search, using the reduced supersky parameter-space metric of Wette and Prix [Phys. Rev. D 88, 123005 (2013)]. The metric prescribes a constant template density in the signal parameters, which permits that templates be placed at the vertices of a lattice. We demonstrate how to ensure complete coverage of the parameter space, including in particular at its boundaries. The number of templates generated by the algorithm is compared to theoretical estimates, and to previous predictions by Brady et al. [Phys. Rev. D 57, 2101 (1998)]. The algorithm may be applied to any search parameter space with a constant template density, which includes semicoherent searches and searches targeting known low-mass X-ray binaries.