Template-based searches for gravitational waves: efficient lattice covering of flat parameter spaces

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.

10 pages, submitted to CQG for proceedings of GWDAW11

References in corpus (1)

• Computational Approaches to Lattice Packing and Covering Problems

Cited by in corpus (5)

• Gravitational waves from inspiralling compact binaries: hexagonal template placement and its efficiency in detecting physical signals
• Building a stochastic template bank for detecting massive black hole binaries
• A hierarchical search for gravitational waves from supermassive black hole binary mergers
• A template bank to search for gravitational waves from inspiralling compact binaries: II. Phenomenological model
• All-sky search of NAUTILUS data