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

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

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.

I Introduction

Several broadband laser interferometer gravitational-wave (GW) detectors are operating at high sensitivities and will continue to improve over the next decade The LIGO Scientific Collaboration (2009); The Virgo Scientific Collaboration (2005); Grote and the LIGO Scientific Collaboration (2010); et al (2008); Collaboration (2009). As detectors improve it is increasingly likely that GW astronomers will observe gravitational radiation emitted from the coalescence of compact binary systems involving neutron stars and or stellar mass black holes Collaboration (2010).

Because compact binary coalescence (CBC) waveforms are well modeled, GW searches for such signals are conducted by matched filtering the detectors’ data with banks of template waveforms, chosen to adequately cover a region of the signal parameter space Owen (1996). For GW signals from the merger of compact objects with negligible spin, this parameter space is defined by functions of the masses of the two objects. To search for signals within this parameter space, a bank of templates is constructed to sample the parameter space sufficiently densely such that there is minimal loss of signal-to-noise ratio (SNR). Traditionally, template banks used to search this two-dimensional signal parameter space have been constructed using the lattice Cokelaer (2007), referred to as “hexagonally-placed” template banks. This problem becomes more difficult in higher dimensions, where other types of template placement algorithms have recently been investigated Harry et al. (2009); Manca and Vallisneri (2010); Messenger et al. (2009); Prix (2007).

In Cannon et al. (2010) the singular value decomposition (SVD) was applied to CBC waveforms to show how hexagonally-placed template banks with templates could be implemented with filters ( being the nominal number of filters required for the 2-phase templates). This was achieved by truncating the SVD of the matrix consisting of the time-series of the template waveforms. Here we demonstrate that the bases identified by the SVD is effective at spanning the space of all CBC waveforms within the region of parameter space sampled by the original bank. We find that the SVD of a low-density bank provides a basis suitable for constructing all the waveforms from a higher-density bank, even waveforms at arbitrary locations within that region of parameter space.

This paper is organized as follows. Sec. II describes how we apply the SVD to approximately embed the signal manifold in a vector space. Sec. III tests this embedding by reconstructing various points in the manifold. Finally, Sec. IV discusses possible applications of this technique.

Ii Enclosing the signal space with Singular Value Decomposition

In this section we explore how the number of basis vectors required to reconstruct a template bank scales with the initial density of the template bank. We define a template bank of signal waveforms covering a patch of the signal manifold, which is used to test for the presence and strength of signals from in the detectors’ data. We construct a signal matrix in the same manner as Cannon et al. (2010). Specifically, we create a real-valued matrix by alternately filling its rows with the real and imaginary parts (cosine and sine) of the template waveform time series from a CBC template bank covering , .

As in Cannon et al. (2010), we constructed the template matrix with chirp masses , where is the total mass and is the symmetric mass ratio, of and component masses of . Template banks covering this region are created using template placement algorithms of the LIGO Algorithms Library LIGO Scientific Collaboration (). Template placement is done in the plane, where and are defined as

(1)
(2)

and where is some fiducial frequency, which we choose to be Hz.

The non-spinning waveforms for each template are produced to 3.5 post-Newtonian (PN) order, sampled at 2048 Hz, up to the Nyquist frequency of 1024 Hz. The last 10 seconds of each waveform, whitened with the initial LIGO amplitude spectral density, are used to construct . The SVD is then applied to , decomposing the matrix into two unitary matrices, and , and a diagonal matrix

(3)

where is a matrix composed of basis vectors (i.e., unit-norm time-series vectors), is a matrix composed of reconstruction coefficients, and is a matrix containing the singular values of .

In Cannon et al. (2010), it was demonstrated that truncating the reconstruction of to use only the basis vectors with the largest singular values results in an average fractional SNR loss proportional to the sum of the discarded singular values squared. In this investigation, we truncate these reconstruction matrices at . This corresponds roughly to the truncation error of IEEE 754 32-bit floating-point numbers.

Figure 1: The number of filters as a function of minimal match, which increases with the density of the template bank. The total number of filters in the template bank, , is shown by the dashed line. The number of filters needed to reconstruct the template matrix such that , , is shown by the solid line. We find that the number filters needed to reconstruct saturates when the minimal match reaches .

We explore how the number of basis vectors changes as the number of rows in is increased by generating template banks for with increasing density (i.e., increasing minimal match). We confirmed that the number of basis vectors required to reconstruct saturates at a particular value of minimal match. Fig. 1 shows that as the minimal match of the template bank is increased, resulting in denser samplings of , the number of basis vectors needed to reconstruct to the required accuracy saturates around a minimal match of . This indicates that is able to be embedded—to an accuracy of 1 part in —in a vector space consisting of dimensions.

In the next section we will demonstrate how the basis waveforms identified by the coarsely sampled bank can be used to reconstruct templates at arbitrary points on the signal manifold.

Iii Efficient reconstruction of waveforms in the manifold

In order to determine how well these waveforms can be reconstructed, we compute a quantity called the average fractional SNR loss . This quantity can be thought of as the mismatch between the original waveform and the reconstructed waveform , averaged over the phase angle. It tells us how far the reconstructed waveform is from the original waveform. As in Eq. (25) of Cannon et al. (2010), is given in terms of SVD quantities as

(4)

where and are the reconstruction coefficients for the real and imaginary parts, respectively, of the th waveform associated with the th basis vector and are elements of , is the th element of , and the sum is over the truncated terms of and .

Figure 2: A visual representation showing the two types of points of that we can choose to reconstruct. The left cartoon shows an example point that is in , and thus in . The right cartoon shows an example point that is not part of H but is in .

We test this embedding of the signal manifold to see how well various points in the manifold can be reconstructed. The tests points we reconstruct are of two types: 1) those from the original signal matrix , 2) those absent from but within . These two types of tests are illustrated in Fig. 2.

Figure 3: A histogram of the reconstruction accuracy of the waveforms that went into the construction of . As expected, the average reconstruction (solid line) accuracy matches the expected fractional SNR loss (dashed line).

A test of the first type is shown in Fig. 3. This shows that the average reconstruction accuracy for points from agrees with our chosen value of . This result is expected as it is an extension of the investigation from Fig. 4 of Cannon et al. (2010) applied to a more stringent reconstruction accuracy.

Figure 4: (left) A histogram of the mismatch between waveforms from that were not in and their reconstructed versions. The peak of the mismatch is slightly above the expected fractional SNR loss for waveforms from (dashed line). (right) How the mismatch varies across , averaged across the direction. The largest mismatches come from near the borders of the template bank in the direction. Fig. 5 restricts our attention to the central of the domain of , whose boundaries are shown as vertical dotted lines.

A test of the second type is shown in Fig. 4. To choose points uniformly from but absent from , we generate a denser template bank within the same region of parameter space described in the Sec. II. Specifically, we generate this template bank with a minimal match of . In order to test the reconstruction accuracy of these waveforms, we project the real and imaginary parts of the waveforms onto the basis vectors from the SVD of

(5)

where represents a reconstruction coefficient associated with the th basis vector for the real or imaginary part of the th waveform from the denser template bank, is the th element of , is the th time sample of the real or imaginary part of the th waveform from the denser template bank, and is the th time sample from the th basis vector in . The real and imaginary parts of the waveforms from the denser template bank are then reconstructed using

(6)
Figure 5: Similar plots as in Fig. 4, eliminating test points near the boundaries in the direction. (left) A histogram of the mismatch between waveforms from that were not in and their reconstructed versions. The average reconstruction (solid line) accuracy is slightly worse than the expected fractional SNR loss (dashed line).

The distribution of for these waveforms, left panel of Fig. 4, shows a tail extending to large mismatches. Examining where these large mismatches are located in parameter space, we find they originate from near the boundaries of . Removing the test points near the boundaries in the direction, shown in Fig. 5, we find the tail of large mismatches disappears.

Figure 6: (left) A plot showing a smaller region of . The circles are points whose waveforms go into . The line segment connects one of those points, , with the point , the central point of and two of its nearest neighbors. Point is situated such that it should have a fitting factor with each of the surrounding points. (right) How well a waveform from a given point of , , can be “matched”. The Match shows the normalized inner-product between and the waveform from the corresponding point along . The Fitting Factor shows the same match maximized over phase and time. Since we are using a minimal match bank, it is expected that the fitting factor falls to around that value. The SVD Projection is given by . The SVD basis vectors are able to reconstruct to high accuracy all points along the line.

An additional test of the second type, which systematically explores the reconstruction accuracy near a point whose waveform went into , is shown in Fig. 6. The left panel shows a set of three nearest-neighbor templates. We investigate how the reconstruction accuracy varies as one moves from point to the central point, point . Point is assumed to have the largest mismatch between its waveform and the waveforms from any of the three surrounding points. We also compute the mismatch between the waveforms along and the waveform of point with and without maximizing over phase and time, called the fitting factor and match respectively. The fitting factor falls to the minimal match of the template bank when comparing the waveforms from and , which is expected as the minimal match involves maximizing over phase and time. The reconstruction accuracy associated with SVD projection is consistently high and close to the chosen reconstruction accuracy of 1 part in .

Iv Discussion

These investigations show that the SVD can be used to find a set of basis vectors that not only span the signal matrix , but also enclose the signal manifold sampled by .

GW pipelines that search for known waveforms, such as GWs from CBCs, commonly compute waveform consistency statistics that compare the observed response of a template waveform filter to the data with what one would expect given the presence of that signal. These consistency statistics are found to perform better when the mismatch between the template waveform and the signal waveform is small Allen (2005). Filtering with a fixed density template bank can introduce mismatch between the nearest template and the signal. This mismatch can be greatly reduced if one is able to find the exact point in parameter space where the signal is located and filter the data using that point. Using the SVD basis vectors, one could reconstruct a point closer to the point of the signal and improve the waveform consistency statistics.

Parameter estimation techniques for GWs from CBCs often use Monte Carlo Markov Chain algorithms to search the parameter space. This involves producing waveforms and filtering the data against many points of the parameter space. The SVD could also be used to interpolate waveforms that are expensive to compute, as in the case of waveforms produced by solving differential equations. Also, if one filtered the data using the basis vectors from the SVD, it would be very easy to reconstruct to high accuracy the output one would see if one had filtered the data using a waveform from anywhere within the parameter space.

In order to gain benefit from these applications, it would be necessary to determine the reconstruction coefficients in a computationally efficient manner. This work has not tried to address this problem as: 1) it has assumed the target waveforms are known, and 2) it computes the reconstruction coefficients using computationally expensive inner products. Generation of these reconstruction coefficients warrants future investigation as the benefits derived from this technique would be substantial.

Acknowledgements.
The authors would like to acknowledge the support of the LIGO Lab, NSF grants PHY-0653653 and PHY-0601459, and the David and Barbara Groce Fund at Caltech. LIGO was constructed by the California Institute of Technology and Massachusetts Institute of Technology with funding from the National Science Foundation and operates under cooperative agreement PHY-0757058. Research at Perimeter Institute is supported through Industry Canada and by the Province of Ontario through the Ministry of Research & Innovation. KC was supported by the National Science and Engineering Research Council, Canada. DK was supported in part from the Max Planck Gesellschaft. This work has LIGO document number LIGO-P1000039-v2.

References

  1. The LIGO Scientific Collaboration, “Advanced LIGO anticipated sensitivity curves,”  (2009).
  2. The Virgo Scientific Collaboration, “Advanced Virgo white paper,”  (2005).
  3. H. Grote and the LIGO Scientific Collaboration, Class. Quant. Grav. 27, 084003 (2010).
  4. F. A. et al, Classical and Quantum Gravity 25, 114045 (2008).
  5. T. L. S. Collaboration, Rep. Prog. Phys. 72, 076901 (2009).
  6. T. L. S. Collaboration, Class. Quantum Grav. 27, 173001 (2010).
  7. B. J. Owen, Phys. Rev. D 53, 6749 (1996).
  8. T. Cokelaer, Phys. Rev. D 76, 102004 (2007).
  9. I. W. Harry, B. Allen,  and B. S. Sathyaprakash, Phys. Rev. D 80, 104014 (2009).
  10. G. M. Manca and M. Vallisneri, Phys. Rev. D 81, 024004 (2010).
  11. C. Messenger, R. Prix,  and M. A. Papa, Phys. Rev. D 79, 104017 (2009).
  12. R. Prix, Classical and Quantum Gravity 24, S481 (2007).
  13. K. Cannon, A. Chapman, C. Hanna, D. Keppel, A. C. Searle,  and A. J. Weinstein, Phys. Rev. D 82, 044025 (2010).
  14. LIGO Scientific Collaboration, “LSC Algorithm Library,” https://www.lsc-group.phys.uwm.edu/daswg/projects/lal.html .
  15. B. Allen, Phys. Rev. D 71, 062001 (2005).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
107385
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description