Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0712.0343 v2 pith:L27FKYUB submitted 2007-12-03 gr-qc astro-ph

Gravitational-wave data analysis using binary black-hole waveforms

classification gr-qc astro-ph
keywords waveformsbinaryblack-holeemphrelativityanalyticalnumericalsearch
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Coalescing binary black-hole systems are among the most promising sources of gravitational waves for ground-based interferometers. While the \emph{inspiral} and \emph{ring-down} stages of the binary black-hole coalescence are well-modelled by analytical approximation methods in general relativity, the recent progress in numerical relativity has enabled us to compute accurate waveforms from the \emph{merger} stage also. This has an important impact on the search for gravitational waves from binary black holes. In particular, while the current gravitational-wave searches look for each stage of the coalescence separately, combining the results from analytical and numerical relativity enables us to \emph{coherently} search for all three stages using a single template family. `Complete' binary black-hole waveforms can now be produced by matching post-Newtonian waveforms with those computed by numerical relativity. These waveforms can be parametrised to produce analytical waveform templates. The `complete' waveforms can also be used to estimate the efficiency of different search methods aiming to detect signals from black-hole coalescences. This paper summarises some recent efforts in this direction.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.