اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTowards a real-time fully-coherent all-sky search for gravitational waves from compact binary coalescences using particle swarm optimization
119
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
While a fully-coherent all-sky search is known to be optimal for detecting gravitational wave signals from compact binary coalescences, its high computational cost has limited current searches to less sensitive coincidence-based schemes. Following up on previous work that has demonstrated the effectiveness of Particle Swarm Optimization in reducing the computational cost of this search, we present an implementation that achieves near real-time computational speed. This is achieved by combining the search efficiency of PSO with a significantly revised and optimized numerical implementation of the underlying mathematical formalism along with additional multi-threaded parallelization layers in a distributed computing framework. For a network of four second-generation detectors with $60$~min data from each, the runtime of the implementation presented here ranges between $approx 1.4$ to $approx 0.5$ times the data duration for network signal-to-noise ratios (SNRs) of $gtrsim 10$ and $gtrsim 12$, respectively. The reduced runtimes are obtained with small to negligible losses in detection sensitivity: for a false alarm rate of $simeq 1$~event per year in Gaussian stationary noise, the loss in detection probability is $leq 5%$ and $leq 2%$ for SNRs of $10$ and $12$, respectively. Using the fast implementation, we are able to quantify frequentist errors in parameter estimation for signals in the double neutron star mass range using a large number of simulated data realizations. A clear dependence of parameter estimation errors and detection sensitivity on the condition number of the network antenna pattern matrix is revealed. Combined with previous work, this paper securely establishes the effectiveness of PSO-based fully-coherent all-sky search across the entire binary inspiral mass range that is relevant to ground-based detectors.
قيم البحث
اقرأ أيضاً
While a fully-coherent all-sky search is known to be optimal for detecting signals from compact binary coalescences (CBCs), its high computational cost has limited current searches to less sensitive coincidence-based schemes. For a network of first g
eneration GW detectors, it has been demonstrated that Particle Swarm Optimization (PSO) can reduce the computational cost of this search, in terms of the number of likelihood evaluations, by a factor of $approx 10$ compared to a grid-based optimizer. Here, we extend the PSO-based search to a network of second generation detectors and present further substantial improvements in its performance by adopting the local-best variant of PSO and an effective strategy for tuning its configuration parameters. It is shown that a PSO-based search is viable over the entire binary mass range relevant to second generation detectors at realistic signal strengths.
Fully-coherent all-sky search for gravitational wave (GW) signals from the coalescence of compact object binaries is a computationally expensive task. Approximations, such as semi-coherent coincidence searches, are currently used to circumvent the co
mputational barrier with a concomitant loss in sensitivity. We explore the effectiveness of Particle Swarm Optimization (PSO) in addressing this problem. Our results, using a simulated network of detectors with initial LIGO design sensitivities and a realistic signal strength, show that PSO can successfully deliver a fully-coherent all-sky search with < 1/10 the number of likelihood evaluations needed for a grid-based search.
We investigate the use of particle swarm optimization (PSO) algorithm for detection of gravitational-wave signals from compact binary coalescences. We show that the PSO is fast and effective in searching for gravitational wave signals. The PSO-based
aligned-spin coincident multi-detector search recovers appreciably more gravitational-wave signals, for a signal-to-noise ratio (SNR) of 10, the PSO based aligned-spin search recovers approximately 26 $%$ more events as compared to the template bank searches. The PSO-based aligned-spin coincident search uses 48k matched-filtering operations, and provides a better parameter estimation accuracy at the detection stage, as compared to the PyCBC template-bank search in LIGOs second observation run (O2) with 400k template points. We demonstrate an effective PSO-based precessing coincident search with 320k match-filtering operations per detector. We present results of an all-sky aligned-spin coherent search with 576k match-filtering operations per detector, for some examples of two-, three-, and four-detector networks constituting of the LIGO detectors in Hanford and Livingston, Virgo and KAGRA. Techniques for background estimation that are applicable to real data for PSO-based coincident and coherent searches are also presented.
We demonstrate an all-sky search for persistent, narrowband gravitational waves using mock data. The search employs radiometry to sidereal-folded data in order to uncover persistent sources of gravitational waves with minimal assumptions about the si
gnal model. The method complements continuous-wave searches, which are finely tuned to search for gravitational waves from rotating neutron stars while providing a means of detecting more exotic sources that might be missed by dedicated continuous-wave techniques. We apply the algorithm to simulated Gaussian noise at the level of LIGO design sensitivity. We project the strain amplitude sensitivity for the algorithm for a LIGO network in the first observing run to be $h_0 approx 1.2 times 10^{-24}$ ($1%$ false alarm probability, $10%$ false dismissal probability). We include treatment of instrumental lines and detector artifacts using time-shifted LIGO data from the first observing run.
This paper presents the SPIIR pipeline used for public alerts during the third advanced LIGO and Virgo observation run (O3 run). The SPIIR pipeline uses infinite impulse response (IIR) filters to perform extremely low-latency matched filtering and th
is process is further accelerated with graphics processing units (GPUs). It is the first online pipeline to select candidates from multiple detectors using a coherent statistic based on the maximum network likelihood ratio statistic principle. Here we simplify the derivation of this statistic using the singular-value-decomposition (SVD) technique and show that single-detector signal-to-noise ratios from matched filtering can be directly used to construct the statistic for each sky direction. Coherent searches are in general more computationally challenging than coincidence searches due to extra search over sky direction parameters. The search over sky directions follows an embarrassing parallelization paradigm and has been accelerated using GPUs. The detection performance is reported using a segment of public data from LIGO-Virgos second observation run. We demonstrate that the median latency of the SPIIR pipeline is less than 9 seconds, and present an achievable roadmap to reduce the latency to less than 5 seconds. During the O3 online run, SPIIR registered triggers associated with 38 of the 56 non-retracted public alerts. The extreme low-latency nature makes it a competitive choice for joint time-domain observations, and offers the tantalizing possibility of making public alerts prior to the merger phase of binary coalescence systems involving at least one neutron star.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
