期刊
CLASSICAL AND QUANTUM GRAVITY
卷 24, 期 19, 页码 S481-S490出版社
IOP Publishing Ltd
DOI: 10.1088/0264-9381/24/19/S11
关键词
-
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据