2015/10/09 by Jing Ming, B. Krishnan, Badri Krishnan +6 · 2 citations
Mathematics · Physics and Astronomy · #Algorithm #Computer science #Constraint (computer-aided design) #Gamma-ray bursts and supernovae #Gravitational wave #Mathematical optimization #Mathematics #Parameter space #Physics #Position (finance) #Pulsars and Gravitational Waves Research #Radio Astronomy Observations and Technology #Sky #Space (punctuation) #Statistics #astro-ph.HE #gr-qc
paper · pdf · doi:10.1103/physrevd.93.064011
published as Phys. Rev. D 93, 064011 (2016) · 50 pages
arxiv created 2015/10/09 · openalex publication_date 2016/03/04 · arxiv updated 2016/03/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Wide parameter space searches for long-lived continuous gravitational wave signals are computationally limited. It is therefore critically important that the 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 spin-down 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 spin-down should we search through? Finally, what is the optimal search setup that we should use? In this paper we present a general framework that allows us 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.