Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

An improved pipeline to search for gravitational waves from compact binary coalescence

MPG-Autoren
/persons/resource/persons145567

Harry,  Ian
Astrophysical and Cosmological Relativity, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons104895

Dent,  Thomas
Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

Dal Canton,  Tito
Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons41853

Keppel,  Drew
Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

Willis,  Joshua L.
Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)

1508.02357.pdf
(Preprint), 3MB

document-3AccMan.pdf
(Verlagsversion), 2MB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Usman, S. A., Kehl, M. S., Nitz, A. H., Harry, I., Brown, D. A., Capano, C. D., et al. (2016). An improved pipeline to search for gravitational waves from compact binary coalescence. Classical and quantum gravity, 33: 215004, pp. 21. doi:10.1088/0264-9381/33/21/215004.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-002A-1830-E
Zusammenfassung
The second generation of ground-based gravitational-wave detectors will begin taking data in September 2015. Sensitive and computationally-efficient data analysis methods will be required to maximize what we learn from their observations. We describe improvements made to the offline analysis pipeline searching for gravitational waves from stellar-mass compact binary coalescences, and assess how these improvements affect search sensitivity. Starting with the two-stage ihope pipeline used in S5, S6 and VSR1-3 and using two weeks of S6/VSR3 data as test periods, we first demonstrate a pipeline with a simpler workflow. This single-stage pipeline performs matched filtering and coincidence testing only once. This simplification allows us to reach much lower false-alarm rates for loud candidate events. We then describe an optimized chi-squared test which minimizes computational cost. Next, we compare methods of generating template banks, demonstrating that a fixed bank may be used for extended stretches of time. Fixing the bank reduces the cost and complexity, compared to the previous method of regenerating a template bank every 2048 s of analyzed data. Creating a fixed bank shared by all detectors also allows us to apply a more stringent coincidence test, whose performance we quantify. With these improvements, we find a 10% increase in sensitive volume with a negligible change in computational cost.