English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Efficient generation and optimization of stochastic template banks by a neighboring cell algorithm

Fehrmann, H., & Pletsch, H. (2014). Efficient generation and optimization of stochastic template banks by a neighboring cell algorithm. Physical Review D, 90(12): 124049, pp. 4049-4049. doi:10.1103/PhysRevD.90.124049.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0024-766C-4 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-002A-1877-1
Genre: Journal Article

Files

show Files
hide Files
:
1411.3899.pdf (Preprint), 2MB
Name:
1411.3899.pdf
Description:
File downloaded from arXiv at 2015-01-14 09:07
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
:
PhysRevD.90_124049.pdf (Any fulltext), 704KB
Name:
PhysRevD.90_124049.pdf
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Fehrmann, Henning1, Author              
Pletsch, Holger2, Author              
Affiliations:
1Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society, ou_24011              
2Pulsar Observation and Data Analysis, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society, ou_2253649              

Content

show
hide
Free keywords: Astrophysics, Instrumentation and Methods for Astrophysics, astro-ph.IM,General Relativity and Quantum Cosmology, gr-qc
 Abstract: Placing signal templates (grid points) as efficiently as possible to cover a multi-dimensional parameter space is crucial in computing-intensive matched-filtering searches for gravitational waves, but also in similar searches in other fields of astronomy. To generate efficient coverings of arbitrary parameter spaces, stochastic template banks have been advocated, where templates are placed at random while rejecting those too close to others. However, in this simple scheme, for each new random point its distance to every template in the existing bank is computed. This rapidly increasing number of distance computations can render the acceptance of new templates computationally prohibitive, particularly for wide parameter spaces or in large dimensions. This work presents a neighboring cell algorithm that can dramatically improve the efficiency of constructing a stochastic template bank. By dividing the parameter space into sub-volumes (cells), for an arbitrary point an efficient hashing technique is exploited to obtain the index of its enclosing cell along with the parameters of its neighboring templates. Hence only distances to these neighboring templates in the bank are computed, massively lowering the overall computing cost, as demonstrated in simple examples. Furthermore, we propose a novel method based on this technique to increase the fraction of covered parameter space solely by directed template shifts, without adding any templates. As is demonstrated in examples, this method can be highly effective..

Details

show
hide
Language(s):
 Dates: 2014-11-142014-11-172014
 Publication Status: Published in print
 Pages: PRD accepted
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: arXiv: 1411.3899
DOI: 10.1103/PhysRevD.90.124049
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Physical Review D
  Other : Phys. Rev. D.
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Lancaster, Pa. : American Physical Society
Pages: - Volume / Issue: 90 (12) Sequence Number: 124049 Start / End Page: 4049 - 4049 Identifier: ISSN: 0556-2821
CoNE: /journals/resource/111088197762258