A JAX/GPU implementation of a long-transient gravitational-wave search is about 60 times faster per template than ATrHough and suggests that 10^8 to 10^9 templates suffice for near-optimal sensitivity.
One-stop strategy to search for long-duration gravitational-wave signals
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Blind continuous gravitational-wave (CWs) searches are a significant computational challenge due to their long duration and weak amplitude of the involved signals. To cope with such problem, the community has developed a variety of data-analysis strategies which are usually tailored to specific CW searches; this prevents their applicability across the nowadays broad landscape of potential CW source. Also, their sensitivity is typically hard to model, and thus usually requires a significant computing investment. We present fasttracks, a massively-parallel engine to evaluate detection statistics for generic CW signals using GPU computing. We demonstrate a significant increase in computational efficiency by parallelizing the brute-force evaluation of detection statistics without using any computational approximations. Also, we introduce a simple and scalable postprocessing which allows us to formulate a generic semianalytic sensitivity estimate algorithm. These proposals are tested in a minimal all-sky search in data from the third observing run of the LIGO-Virgo-KAGRA Collaboration. The strategies discussed here will become increasingly relevant in the coming years as long-duration signals become a standard observation of future ground-based and space-borne detectors.
citation-role summary
citation-polarity summary
fields
gr-qc 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
GPU-Accelerated Searches for Long-Transient Gravitational Waves from Newborn Neutron Stars
A JAX/GPU implementation of a long-transient gravitational-wave search is about 60 times faster per template than ATrHough and suggests that 10^8 to 10^9 templates suffice for near-optimal sensitivity.