Pith. Sign in

REVIEW

Matched filtering of gravitational waves from inspiraling compact binaries: Computational cost and template placement

General Relativity and Quantum Cosmology · Submitted 27 Aug 1998 · 34 references

Pith's verdict: A solid, honest 1998 resource-budget paper: the 2PN template counts and flops figures are the useful contribution, and the soft spots are real but don't move the headline numbers.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on October 29, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 2 major objections · 7 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDgr-qc/9808076 (version 1)
Pith IDY6JHQP55, Pith's permanent record of this paper and its review
Citation2) ((1) Caltech, (2) Cardiff), Benjamin J. Owen (1), B. S. Sathyaprakash (1. "Matched filtering of gravitational waves from inspiraling compact binaries: Computational cost and template placement." arXiv:gr-qc/9808076 (1998). https://pith.science/paper/Y6JHQP55
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report
The paper

The paper claims

A matched-filter search for inspiraling binaries is priced out in templates, flops, and storage, and the bill is large enough to shape how the searches get built.

The reading

The paper asks a practical question that sits between gravitational-wave theory and computer engineering: if you want to catch the chirp of two compact objects spiraling together, how many waveform templates must you run against the data, and what will that cost in computing power and memory? The authors answer by turning the space of possible binary masses into a curved geometry, where distance measures how much signal-to-noise you lose by using the wrong template, and then computing the proper volume of the region that must be covered. Their headline number is that initial LIGO would need roughly $1.0^{11}$ floating-point operations per second just to keep pace with the data stream, several times the earlier estimate, with advanced LIGO at $7.8^{11}$ and VIRGO at $4.8^{12}$. What makes the number matter is that it is offered as a benchmark: any cleverer strategy, such as a hierarchical search that first passes the data through a coarse grid, has to be measured against this baseline. The paper also sketches how to lay the templates down along the equal-mass line and stack rows outward to cover the mass plane.

What carries the argument

The load-bearing device is a metric on the space of intrinsic binary parameters, built from the match function $M( heta_1, heta_2)$ — the fraction of optimal signal-to-noise recovered by filtering with a template whose parameters differ from the signal's, after maximizing over the unknown coalescence time and phase. Expanding the match about a coincident point gives $M simeq 1 - g_{ij} Delta heta^i Delta heta^j$, so the metric measures how quickly detectability degrades as you move away from the true parameters. The number of templates is then the proper volume of the region of interest divided by the proper volume per lattice cell, with the cell size set by the minimal match and the packing scheme (a rectangle in two dimensions, or a hexagon for a 20% saving). To keep the metric components from varying wildly, the authors use chirp-time coordinates rather than the two masses, and they project out the coalescence time before integrating. A second piece of machinery is the sampling-rate condition: the high-frequency cutoff must be high enough that discretization in time costs less signal-to-noise than discretization in template parameters, which is why their sampling rates, and hence their flop counts, are higher than in earlier work.

Extended reading notes

Core claim

The central claim is a resource budget for a one-step matched-filter search using restricted second post-Newtonian waveforms for nonspinning binaries in circular orbits. Covering all binaries with component masses above $0.2M_*$ while losing no more than 10% of events to coarse template spacing requires about $4.8^{5}$ templates for initial LIGO, $6.9^{6}$ for advanced LIGO, and $9.3^{6}$ for VIRGO on a rectangular lattice at 97% minimal match. Translated through a standard operations count for Fourier-domain filtering, that becomes $9.9^{10}$ flops for initial LIGO, $7.8^{11}$ for advanced LIGO, and $4.8^{12}$ for VIRGO, with stored templates running from $1.5^{11}$ real numbers for TAMA to $6.2^{14}$ for VIRGO. The authors also derive scaling laws: computational power goes roughly as $m_{min}^{-8/3}$ and storage as $m_{min}^{-13/3}$, so pushing the mass threshold down is expensive fast. One pointed corollary they draw is that VIRGO's very broad, flat noise spectrum cannot be fully exploited by this kind of search, because the low-frequency reach multiplies the template count beyond what the available computing can service.

Load-bearing premise

The entire template count rests on treating the match between neighbouring templates as a quadratic bowl out to a 3% mismatch, and the authors' own Fig. 1 caption concedes that at second post-Newtonian order this agreement holds for all but waveforms of massive binaries, which is precisely the corner of parameter space the proper-volume integral includes.

Editorial extensions

If this is right

  • Any proposed shortcut — hierarchical two-stage searches, template interpolation, reduced-order waveform generation — now has a concrete number to beat rather than a vague sense that the naive search is costly.
  • Detector designers get a warning that a broader or flatter noise spectrum buys sensitivity at a superlinear price in analysis cost, since template count scales as $f_0^{-8/3}$ and power as $f_0^{-5/3}$.
  • Searches extending down to subsolar component masses, such as low-mass black hole dark matter candidates, are effectively forced to generate templates on the fly rather than store them, because storage scales as $m_{min}^{-13/3}$.
  • The template-placement algorithm, which walks along the equal-mass curve and stacks rows outward in locally diagonalized coordinates, gives an implementable recipe rather than only a count, including the expected boundary spill-over.
  • The 97% minimal match is tied to a 10% loss of event rate through the cube of the fitting factor, giving a single tunable dial connecting search thoroughness to computational budget.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The budget is a moving target in a useful sense: because power scales as $m_{min}^{-8/3}$, raising the mass floor from $0.2M_*$ to $1M_*$ cuts the requirement by roughly two orders of magnitude, which suggests the mass threshold is the single most consequential design choice in an inspiral search and deserves explicit justification rather than convention.
  • The same geometric machinery should transfer almost unchanged to any waveform family with a smooth parameter dependence, so the metric-plus-proper-volume method is plausibly reusable for eccentricity, spin-aligned, or precessing searches once those waveforms are cheap enough to evaluate.
  • The paper's own numbers imply that the decisive engineering question for a real pipeline is not the flop count but the ratio of data-segment length to filter length, since the operations count carries a $log_2 F$ term that the paper fixes rather than optimizes.
  • If a hierarchical search really delivers the factor-of-25 reduction attributed to it in the literature, then the naive budget in this paper is comfortably affordable at initial-LIGO sensitivity, which reframes the numbers here as an upper bound on what the problem costs rather than a barrier.
Original abstract

We estimate the number of templates, computational power, and storage required for a one-step matched filtering search for gravitational waves from inspiraling compact binaries. These estimates should serve as benchmarks for the evaluation of more sophisticated strategies such as hierarchical searches. We use waveform templates based on the second post-Newtonian approximation for binaries composed of nonspinning compact bodies in circular orbits. We present estimates for six noise curves: LIGO (three configurations), VIRGO, GEO600, and TAMA. To search for binaries with components more massive than 0.2M_o while losing no more than 10% of events due to coarseness of template spacing, initial LIGO will require about 1*10^11 flops (floating point operations per second) for data analysis to keep up with data acquisition. This is several times higher than estimated in previous work by Owen, in part because of the improved family of templates and in part because we use more realistic (higher) sampling rates. Enhanced LIGO, GEO600, and TAMA will require computational power similar to initial LIGO. Advanced LIGO will require 8*10^11 flops, and VIRGO will require 5*10^12 flops. If the templates are stored rather than generated as needed, storage requirements range from 1.5*10^11 real numbers for TAMA to 6*10^14 for VIRGO. We also sketch and discuss an algorithm for placing the templates in the parameter space.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,632 input tokens, $0.0003 reported.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.49 · human participants 0.01 · controlled comparison 0.14 · randomized assignment 0.01 · states quantitative result 0.99 · compares with prior results 0.97 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We estimate the number of templates, computational power, and storage required for a one-step matched filtering search for gravitational waves from inspiraling compact binaries. These estimates should serve as benchmarks for the evaluation of more sophisticated strategies such as hierarchical searches. We use waveform templates based on the second post-Newtonian approximation for binaries composed of nonspinning compact bodies in circular orbits. We present estimates for six noise curves: LIGO (three configurations), VIRGO, GEO600, and TAMA. To search for binaries with components more massive than 0.2M_o while losing no more than 10% of events due to coarseness of template spacing, initial LIGO will require about 1*10^11 flops (floating point operations per second) for data analysis to keep up with data acquisition. This is several times higher than estimated in previous work by Owen, in part because of the improved family of templates and in part because we use more realistic (higher) sampling rates. Enhanced LIGO, GEO600, and TAMA will require computational power similar to initial LIGO. Advanced LIGO will require 8*10^11 flops, and VIRGO will require 5*10^12 flops. If the templates are stored rather than generated as needed, storage requirements range from 1.5*10^11 real numbers for TAMA to 6*10^14 for VIRGO. We also sketch and discuss an algorithm for placing the templates in the parameter space.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We estimate the number of templates, computational power, and storage required for a one-step matched filtering search for gravitational waves from inspiraling compact binaries. contribution 1.00 0.92 0.08 asserted 0.97
s1 These estimates should serve as benchmarks for the evaluation of more sophisticated strategies such as hierarchical searches. interpretation 0.54 0.17 0.08 asserted 0.49
s2 We use waveform templates based on the second post-Newtonian approximation for binaries composed of nonspinning compact bodies in circular orbits. method 1.00 0.71 0.03 asserted 1.00
s3 We present estimates for six noise curves: LIGO (three configurations), VIRGO, GEO600, and TAMA. contribution 0.51 0.87 0.04 asserted 1.00
s4 To search for binaries with components more massive than 0.2M_o while losing no more than 10% of events due to coarseness of template spacing, initial LIGO will require about 1*10^11 flops (floating point operations per second) for data analysis to keep up with data acquisition. result 1.00 0.91 0.28 asserted 0.83
s5 This is several times higher than estimated in previous work by Owen, in part because of the improved family of templates and in part because we use more realistic (higher) sampling rates. result 0.51 0.65 0.07 asserted 0.97
s6 Enhanced LIGO, GEO600, and TAMA will require computational power similar to initial LIGO. result 1.00 0.85 0.06 asserted 1.00
s7 Advanced LIGO will require 8*10^11 flops, and VIRGO will require 5*10^12 flops. result 1.00 0.90 0.18 asserted 1.00
s8 If the templates are stored rather than generated as needed, storage requirements range from 1.5*10^11 real numbers for TAMA to 6*10^14 for VIRGO. result 1.00 0.90 0.07 asserted 0.88
s9 We also sketch and discuss an algorithm for placing the templates in the parameter space. contribution 0.57 0.89 0.03 asserted 0.89

What kind of paper the classifier reports this is: simulation study 0.57 · evidence from simulation or computation 0.95.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 1. FIG. 1. Comparison of the match to the quadratic approximati
Figure 2. FIG. 2. The parameter space of search in terms of (a) standard
Figure 3. FIG. 3. Illustration of optimal translation of a template al
Figure 4. FIG. 4. Choice of templates in the space of chirp times for ini

Figures reproduced from arXiv:gr-qc/9808076 by the authors.

References
How later papers used it

116 later papers cite it

Evidence: substantial. 108 of the citing papers share no author with it, and 24 of those carry a confident label from Pith's citation classifier.

Pith read 11 of the 177 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Builds on it 1 of 2 papers with this label · 1 by the same authors

By the same authors

Uses its method or tool 1 of 25 papers with this label
How the literature uses it

80 arXiv papers cite this in 127 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 66 sentences without a confident label

Builds on it 2 papers
Uses its method or tool 19 papers
Compares with it 1 paper
Cites it as support 1 paper
Cites it as background 29 papers

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.