English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Efficiently enclosing the compact binary parameter space by singular-value decomposition

MPS-Authors
/persons/resource/persons41853

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

External Ressource
No external resources are shared
Fulltext (public)

1101.4939
(Preprint), 581KB

PRD84_084003.pdf
(Any fulltext), 496KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Cannon, K., Hanna, C., & Keppel, D. (2011). Efficiently enclosing the compact binary parameter space by singular-value decomposition. Physical Review D, 84(8): 084003. Retrieved from http://arxiv.org/abs/1101.4939.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-0175-2
Abstract
Gravitational-wave searches for the merger of compact binaries use matched-filtering as the method of detecting signals and estimating parameters. Such searches construct a fine mesh of filters covering a signal parameter space at high density. Previously it has been shown that singular value decomposition can reduce the effective number of filters required to search the data. Here we study how the basis provided by the singular value decomposition changes dimension as a function of template bank density. We will demonstrate that it is sufficient to use the basis provided by the singular value decomposition of a low density bank to accurately reconstruct arbitrary points within the boundaries of the template bank. Since this technique is purely numerical it may have applications to interpolating the space of numerical relativity waveforms.