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

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

2011-01-25

arxiv.org/abs/1101.4939v1

Astronomy and Astrophysics

Astrophysics

General Relativity and Quantum Cosmology

5 pages, 6 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficiently enclosing the compact binary parameter space by singular-value decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficiently enclosing the compact binary parameter space by singular-value decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently enclosing the compact binary parameter space by singular-value decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418208