English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Spherical ansatz for parameter-space metrics

MPS-Authors
/persons/resource/persons40518

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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

1906.01352.pdf
(Preprint), 469KB

PhysRevD.100.124004.pdf
(Publisher version), 322KB

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

Allen, B. (2019). Spherical ansatz for parameter-space metrics. Physical Review D, 100: 124004. doi:10.1103/PhysRevD.100.124004.


Cite as: https://hdl.handle.net/21.11116/0000-0005-5AE8-1
Abstract
A fundamental quantity in signal analysis is the metric $g_{ab}$ on parameter
space, which quantifies the fractional "mismatch" $m$ between two (time- or
frequency-domain) waveforms. When searching for weak gravitational-wave or
electromagnetic signals from sources with unknown parameters $\lambda$ (masses,
sky locations, frequencies, etc.) the metric can be used to create and/or
characterize "template banks". These are grids of points in parameter space;
the metric is used to ensure that the points are correctly separated from one
another. For small coordinate separations $d\lambda^a$ between two points in
parameter space, the traditional ansatz for the mismatch is a quadratic form
$m=g_{ab} d\lambda^a d\lambda^b$. This is a good approximation for small
separations but at large separations it diverges, whereas the actual mismatch
is bounded. Here we introduce and discuss a simple "spherical" ansatz for the
mismatch $m=\sin^2(\sqrt{g_{ab} d\lambda^a d\lambda^b})$. This agrees with the
metric ansatz for small separations, but we show that in simple cases it
provides a better (and bounded) approximation for large separations, and argue
that this is also true in the generic case. This ansatz should provide a more
accurate approximation of the mismatch for semi-coherent searches, and may also
be of use when creating grids for hierarchical searches that (in some stages)
operate at relatively large mismatch.