Talk detail

MG15 - Talk detail

Back to previous page

 Participant

Roy, Soumen

Institution

IIT Gandhinagar  - Palaj - Gandhinagar - Gujarat - India

Session

GW4

Accepted

Order

Time

Talk

Oral abstract

Title

A New Template Placement Algorithm For Gravitational Wave Searches From Compact Binaries In Advanced-LIGO
Coauthors

Abstract

Several gravitational wave (GW) signals from the binary neutron stars and blackholes have been detected in terrestrial broadband interferometric observatories like the Advanced LIGO and Virgo detectors. In these searches, the data is match-filtered against a set of possible template waveforms spanning a wide range of parameters. Development of efficient placement strategies for covering the search parameter space leads to computational efficiency. This is particularly important in the era of advanced detectors, where the increased bandwidth and low-frequency sensitivity of the detector have resulted in a vast increase in template bank sizes as seen in the recently concluded O1 and O2 searches. To this end, we present a new template placement algorithm that combines the robustness of the stochastic placement method along with the efficiency afforded by the use of (A*n) lattice to cover the search space. We show that the template placement is resilient to variations in the curvature of the parameter space and can deal with irregular boundaries without any explicit fine-tuning in the design. We also develop a numerical method to evaluate the metric in the space of waveform parameters, with an excellent agreement with the numerical ambiguity function. This technique is computationally efficient that can be used to compute the metric for any non-precessing waveform families. By using this metric, we construct various hybrid banks and compare them against stochastic banks, including the one used in O2 searches. We establish that, while both are equally effective in capturing sources modelled by SEOBNRv4 and IMRphenomD waveform families, the new hybrid banks are significantly smaller in size and take minimal computational time for their generation.

Pdf file

 

Back to previous page