Long-duration transient gravitational-wave search pipeline
Long-duration transient gravitational-wave search pipeline
复制标题
DOI：
10.1103/physrevd.104.102005
复制
发表时间：
2021-08
影响因子：
5
通讯作者：
A. Macquet;M. Bizouard;N. Christensen;M. Coughlin
中科院分区：
文献类型：
--
作者：
A. Macquet;M. Bizouard;N. Christensen;M. Coughlin
随着引力波探测器的灵敏度和观测时间的增加，人们期望从各种来源观测到更多样化的信号。特别是在过去的十年里，长寿命的引力波瞬变现象引起了人们的兴趣。由于大多数长持续时间信号的建模很差，检测必须依赖于通用搜索算法，这些算法很少或根本没有对信号的性质进行假设。然而，这些搜索的计算成本仍然是一个限制因素，导致次优灵敏度。已经开发了几种检测算法来处理这个问题。在本文中，我们提出了一种新的数据分析管道，用于搜索持续时间在10到1000秒之间的未建模的长寿命瞬态引力波信号，基于探测器网络中的过量交叉功率统计。该管道实现了几个新功能，旨在降低计算成本并提高对各种信号形态的检测灵敏度。该方法被推广到任意数量的检测器网络，旨在为进一步改进提供一个稳定的接口。与之前在模拟和真实引力波数据上实现的类似方法相比，根据信号形态的不同，检测效率总体上有所提高，计算时间至少减少了10倍。
As the sensitivity and observing time of gravitational-wave detectors increase, a more diverse range of signals is expected to be observed from a variety of sources. Especially, long-lived gravitational-wave transients have received interest in the last decade. Because most of long-duration signals are poorly modeled, detection must rely on generic search algorithms, which make few or no assumption on the nature of the signal. However, the computational cost of those searches remains a limiting factor, which leads to sub-optimal sensitivity. Several detection algorithms have been developed to cope with this issue. In this paper, we present a new data analysis pipeline to search for un-modeled long-lived transient gravitational-wave signals with duration between 10 and 1000 s, based on an excess cross-power statistic in a network of detectors. The pipeline implements several new features that are intended to reduce computational cost and increase detection sensitivity for a wide range of signal morphologies. The method is generalized to a network of an arbitrary number of detectors and aims to provide a stable interface for further improvements. Comparisons with a previous implementation of a similar method on simulated and real gravitational-wave data show an overall increase in detection efficiency depending on the signal morphology, and a computing time reduced by at least a factor 10.