REVIEW 2 cited by
Template-based searches for gravitational waves: efficient lattice covering of flat parameter spaces
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
read the original abstract
The construction of optimal template banks for matched-filtering searches is an example of the sphere covering problem. For parameter spaces with constant-coefficient metrics a (near-) optimal template bank is achieved by the A_n* lattice, which is the best lattice-covering in dimensions n <= 5, and is close to the best covering known for dimensions n <= 16. Generally this provides a substantially more efficient covering than the simpler hyper-cubic lattice. We present an algorithm for generating lattice template banks for constant-coefficient metrics and we illustrate its implementation by generating A_n* template banks in n=2,3,4 dimensions.
Forward citations
Cited by 2 Pith papers
-
A geometric template bank for the detection of spinning low-mass compact binaries with moderate orbital eccentricity
A geometric template bank including eccentricity recovers moderately eccentric BNS/NSBH signals with less than 6% loss, while quasi-circular banks miss up to 40%.
-
One-stop strategy to search for long-duration gravitational-wave signals
A generic GPU search engine plus a fast semianalytic sensitivity estimator could make blind continuous gravitational-wave searches much cheaper to run and characterize.
Discussion (0). Continue with ORCID to comment.