相关论文: Template-based searches for gravitational waves: e…

Template-based searches for gravitational waves are often limited by the computational cost associated with searching large parameter spaces. The study of efficient template banks, in the sense of using the smallest number of templates, is…

When searching for new gravitational-wave or electromagnetic sources, the $n$ signal parameters (masses, sky location, frequencies,...) are unknown. In practice, one hunts for signals at a discrete set of points in parameter space, called a…

Matched filtering is a traditional method used to search a data stream for signals. If the source (and hence its $n$ parameters) are unknown, many filters must be employed. These form a grid in the $n$-dimensional parameter space, known as…

All-sky, broadband, coherent searches for gravitational-wave pulsars are restricted by limited computational resources. Minimizing the number of templates required to cover the search parameter space, of sky position and frequency…

When searching for new gravitational-wave or electromagnetic sources, the $n$ signal parameters (masses, sky location, frequencies,...) are unknown. In practice, one hunts for signals at a discrete set of points in parameter space, with a…

Gravitational wave searches are crucial for studying compact sources like neutron stars and black holes. Many sensitive modeled searches use matched filtering to compare gravitational strain data to a set of waveform models known as…

This paper presents an algorithm for constructing matched-filter template banks in an arbitrary parameter space. The method places templates at random, then removes those which are "too close" together. The properties and optimality of…

All-sky, broadband, coherent searches for gravitational-wave pulsars are computationally limited. It is therefore important to make efficient use of available computational resources, notably by minimizing the number of templates used to…

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…

We report the construction of a three-dimensional template bank for the search for gravitational waves from inspiralling binaries consisting of spinning compact objects. The parameter space consists of two dimensions describing the mass…

One strategy for reducing the online computational cost of matched-filter searches for gravitational waves is to introduce a compressed basis for the waveform template bank in a grid-based search. In this paper, we propose and investigate…

We describe the application of the lattice covering problem to the placement of templates in a search for continuous gravitational waves from the low-mass X-Ray binary Scorpius X-1. Efficient placement of templates to cover the parameter…

All-sky surveys for isolated continuous gravitational waves present a significant data-analysis challenge. Semicoherent search methods are commonly used to efficiently perform the computationally-intensive task of searching for these weak…

All-sky searches for gravitational-wave pulsars are generally limited in sensitivity by the finite availability of computing resources. Semicoherent searches are a common method of maximizing search sensitivity given a fixed computing…

We have studied the problem of all sky search in reference to continuous gravitational wave particularly for such sources whose wave-form are known in advance. We have made an analysis of the number of templates required for matched filter…

The sensitivity of all-sky searches for gravitational-wave pulsars is primarily limited by the finite availability of computing resources. Semicoherent searches are a widely-used method of maximizing sensitivity to gravitational-wave…

We introduce a general method for designing tailored lattices of magnetic microtraps for ultracold atoms, on the basis of patterned permanently magnetized films. A fast numerical algorithm is used to automatically generate patterns which…

The kernel interpolant in a reproducing kernel Hilbert space is optimal in the worst-case sense among all approximations of a function using the same set of function values. In this paper, we compare two search criteria to construct lattice…

The efficient placement of signal templates in source-parameter space is a crucial requisite for exhaustive matched-filtering searches of modeled gravitational-wave sources. Unfortunately, the current placement algorithms based on regular…

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…