Efficient generation and optimization of stochastic template banks by a neighboring cell algorithm

Abstract

Placing signal templates (grid points) as efficiently as possible to cover a multi-dimensional parameter space is crucial in computing-intensive matched-filtering searches for gravitational waves, but also in similar searches in other fields of astronomy. To generate efficient coverings of arbitrary parameter spaces, stochastic template banks have been advocated, where templates are placed at random while rejecting those too close to others. However, in this simple scheme, for each new random point its distance to every template in the existing bank is computed. This rapidly increasing number of distance computations can render the acceptance of new templates computationally prohibitive, particularly for wide parameter spaces or in large dimensions. This work presents a neighboring cell algorithm that can dramatically improve the efficiency of constructing a stochastic template bank. By dividing the parameter space into sub-volumes (cells), for an arbitrary point an efficient hashing technique is exploited to obtain the index of its enclosing cell along with the parameters of its neighboring templates. Hence only distances to these neighboring templates in the bank are computed, massively lowering the overall computing cost, as demonstrated in simple examples. Furthermore, we propose a novel method based on this technique to increase the fraction of covered parameter space solely by directed template shifts, without adding any templates. As is demonstrated in examples, this method can be highly effective..

arXiv commentPRD accepted

References in corpus (14)

• Gravitational Waves from Mergin Compact Binaries: How Accurately Can One Extract the Binary's Parameters from the Inspiral Waveform?
• Search templates for gravitational waves from inspiraling binaries: Choice of template spacing
• Detector Description and Performance for the First Coincidence Observations between LIGO and GEO
• Gravitational waves from coalescing binaries: detection strategies and Monte Carlo estimation of parameters
• A stochastic template placement algorithm for gravitational wave data analysis
• The Einstein@Home search for periodic gravitational waves in LIGO S4 data
• Binary Millisecond Pulsar Discovery via Gamma-Ray Pulsations
• Einstein@Home all-sky search for periodic gravitational waves in LIGO S5 data
• Pulsar Discovery by Global Volunteer Computing
• Random template banks and relaxed lattice coverings
• The Einstein@Home search for radio pulsars and PSR J2007+2722 discovery
• Building a stochastic template bank for detecting massive black hole binaries
• Cover art: issues in the metric-guided and metric-less placement of random and stochastic template banks
• Toward the search for gravitational waves from inspiralling compact binaries in TAMA300 data during 2003: data quality and stability

Cited by in corpus (11)

• Searching for Gravitational Waves from Compact Binaries with Precessing Spins
• Discovery of a Gamma-ray Black Widow Pulsar by GPU-accelerated Einstein@Home
• Einstein@Home Discovery of the Gamma-ray Millisecond Pulsar PSR J2039-5617 Confirms Its Predicted Redback Nature
• Optimal Template Banks
• Exploiting Orbital Constraints from Optical Data to Detect Binary Gamma-ray Pulsars
• Spherical ansatz for parameter-space metrics
• Efficient Gravitational Wave Template Bank Generation with Differentiable Waveforms
• An implementation of Galactic white dwarf binary data analysis for MLDC-3.1
• A geometric template bank for the detection of spinning low-mass compact binaries with moderate orbital eccentricity
• Reducing the number of templates for aligned-spin compact binary coalescence gravitational wave searches using metric-agnostic template nudging
• Performance of Random Template Banks