Hierarchical search strategy for the detection of gravitational waves from coalescing binaries: Extension to post-Newtonian waveforms

Hierarchical search strategy for the detection of gravitational waves from coalescing binaries: Extension to post-Newtonian waveforms
复制标题

用于检测聚结双星引力波的分层搜索策略:扩展到后牛顿波形

DOI:
10.1103/physrevd.57.630
复制
发表时间:
1997
期刊:
影响因子:
5
通讯作者:
S. Mohanty
S. Mohanty
中科院分区:
物理与天体物理2区
文献类型:
--
作者:
S. Mohanty

文献摘要

被引文献

相似文献

如果使用一组模板波形(即一步搜索),从聚结致密双星中检测引力波将是一个计算密集型过程。在之前的一篇论文中,我们提出了一种检测策略,称为两步搜索},它利用了模板库的层次结构。结果表明,在牛顿信号族的简单情况下,在线两步搜索比在线一步搜索(对于初始 LIGO)大约快 8 倍。在本文中,我们将两步搜索扩展到更现实的零自旋 1.5 后牛顿波形的情况。我们还提出了考虑统计相关性的检测和误报概率的公式。我们发现,对于 1.5 后牛顿模板和信号族的情况,在线两步搜索所需的计算能力约为相应在线一步搜索所需的计算能力的 1/21。当需要以 0.95 的概率检测到强度 S = 10.34 的信号、平均每年一次错误事件、并且使用的噪声功率谱密度是先进 LIGO 的噪声功率谱密度时,可以实现这种减少。对于初始 LIGO,当 S = 9.98 时,计算能力降低约 1/27,检测和误报概率与上述相同。
The detection of gravitational waves from coalescing compact binaries would be a computationally intensive process if a single bank of template wave forms (i.e., a one step search) is used. In an earlier paper we had presented a detection strategy, called a two step search}, that utilizes a hierarchy of template banks. It was shown that in the simple case of a family of Newtonian signals, an on-line two step search was about 8 times faster than an on-line one step search (for initial LIGO). In this paper we extend the two step search to the more realistic case of zero spin 1.5 post-Newtonian wave forms. We also present formulas for detection and false alarm probabilities which take statistical correlations into account. We find that for the case of a 1.5 post-Newtonian family of templates and signals, an on-line two step search requires about 1/21 the computing power that would be required for the corresponding on-line one step search. This reduction is achieved when signals having strength S = 10.34 are required to be detected with a probability of 0.95, at an average of one false event per year, and the noise power spectral density used is that of advanced LIGO. For initial LIGO, the reduction achieved in computing power is about 1/27 for S = 9.98 and the same probabilities for detection and false alarm as above.