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

Simple item page
dc.creatorPrix, Reinhard
dc.date2007-07-03
dc.date.accessioned2026-07-07T10:36:15Z
dc.date.available2026-07-07T10:36:15Z
dc.descriptionThe 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.
dc.description10 pages, submitted to CQG for proceedings of GWDAW11
dc.identifierhttps://arxiv.org/abs/0707.0428
dc.identifierhttp://arxiv.org/abs/0707.0428
dc.identifierClass.Quant.Grav.24:S481-S490,2007
dc.identifierdoi:10.1088/0264-9381/24/19/S11
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/179987
dc.subjectGeneral Relativity and Quantum Cosmology
dc.titleTemplate-based searches for gravitational waves: efficient lattice covering of flat parameter spaces
dc.typetext

Files

Collections

arXiv