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

アイテム詳細


公開

成果報告書

A new framework to follow up candidates from continuous gravitational-wave searches

MPS-Authors
/persons/resource/persons270913

Covas,  P. B.
Searching for Continuous Gravitational Waves, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons40534

Prix,  R.
Searching for Continuous Gravitational Waves, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons298037

Martins,  J.
Searching for Continuous Gravitational Waves, 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.
フルテキスト (公開)

2404.18608.pdf
(プレプリント), 5MB

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

Covas, P. B., Prix, R., & Martins, J. (in preparation). A new framework to follow up candidates from continuous gravitational-wave searches.


引用: https://hdl.handle.net/21.11116/0000-000F-3A9A-3
要旨
Searches for continuous gravitational waves from unknown neutron stars are
limited in sensitivity due to their high computational cost. For this reason,
developing new methods or improving existing ones can increase the probability
of making a detection. In this paper we present a new framework that uses MCMC
or nested sampling methods to follow-up candidates of continuous
gravitational-wave searches. This framework aims to go beyond the capabilities
of PYFSTAT (which is limited to the PTEMCEE sampler), by allowing a flexible
choice of sampling algorithm (using BILBY as a wrapper) and multi-dimensional
correlated prior distributions. We show that MCMC and nested sampling methods
can recover the maximum posterior point for much bigger parameter-space regions
than previously thought (including for sources in binary systems), and we
present tests that examine the capabilities of the new framework: a comparison
between the DYNESTY, NESSAI, and PTEMCEE samplers, the usage of correlated
priors, and its improved computational cost.