日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

学術論文

Optimal directed searches for continuous gravitational waves

MPS-Authors
/persons/resource/persons206595

Ming,  Jing
Searching for Continuous Gravitational Waves, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons20661

Krishnan,  Badri
Astrophysical Relativity, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons20662

Papa,  Maria Alessandra
Searching for Continuous Gravitational Waves, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons40519

Aulbert,  Carsten
Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons40523

Fehrmann,  Henning
Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)

1510.03417.pdf
(プレプリント), 11MB

付随資料 (公開)
There is no public supplementary material available
引用

Ming, J., Krishnan, B., Papa, M. A., Aulbert, C., & Fehrmann, H. (2016). Optimal directed searches for continuous gravitational waves. Physical Review D, 93:. doi:10.1103/PhysRevD.93.064011.


引用: https://hdl.handle.net/11858/00-001M-0000-002A-718D-0
要旨
Wide parameter space searches for long lived continuous gravitational wave
signals are computationally limited. It is therefore critically important that
available computational resources are used rationally. In this paper we
consider directed searches, i.e. targets for which the sky position is known
accurately but the frequency and spindown parameters are completely unknown.
Given a list of such potential astrophysical targets, we therefore need to
prioritize. On which target(s) should we spend scarce computing resources? What
parameter space region in frequency and spindown should we search? Finally,
what is the optimal search set-up that we should use? In this paper we present
a general framework that allows to solve all three of these problems. This
framework is based on maximizing the probability of making a detection subject
to a constraint on the maximum available computational cost. We illustrate the
method for a simplified problem.