de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Search for Continuous Gravitational Waves: Optimal StackSlide method at fixed computing cost

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons40534

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons40537

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)

1201.4321
(Preprint), 719KB

PRD85_084010.pdf
(beliebiger Volltext), 455KB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Prix, R., & Shaltev, M. (2012). Search for Continuous Gravitational Waves: Optimal StackSlide method at fixed computing cost. Physical Review D, 85(8): 084010. doi:10.1103/PhysRevD.85.084010.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3D28-7
Zusammenfassung
Coherent wide parameter-space searches for continuous gravitational waves are typically limited in sensitivity by their prohibitive computing cost. Therefore semi-coherent methods (such as StackSlide) can often achieve a better sensitivity. We develop an analytical method for finding optimal StackSlide parameters at fixed computing cost under ideal conditions of gapless data with Gaussian stationary noise. This solution separates two regimes: an unbounded regime, where it is always optimal to use all the data, and a bounded regime with a finite optimal observation time. Our analysis of the sensitivity scaling reveals that both the fine- and coarse-grid mismatches contribute equally to the average StackSlide mismatch, an effect that had been overlooked in previous studies. We discuss various practical examples for the application of this optimization framework, illustrating the potential gains in sensitivity compared to previous searches.