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

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

End-to-end algorithm for hierarchical area searches for long-duration GW sources for GEO 600

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

Schutz,  Bernard F.
Astrophysical Relativity, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

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

Papa,  Maria Alessandra
Astrophysical Relativity, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

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

60233.pdf
(Preprint), 118KB

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

Schutz, B. F., & Papa, M. A. (1999). End-to-end algorithm for hierarchical area searches for long-duration GW sources for GEO 600. In Proceedings of Moriond meeting Gravitational Waves and Experimental Gravity (pp. 199-205).


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0013-73CA-0
Zusammenfassung
We describe a hierarchical, highly parallel computer algorithm to perform searches for unknown sources of continuous gravitational waves -- spinning neutron stars in the Galaxy -- over wide areas of the sky and wide frequency bandwidths. We optimize the algorithm for an observing period of 4 months and an available computing power of 20 Gflops, in a search for neutron stars resembling millisecond pulsars. We show that, if we restrict the search to the galactic plane, the method will detect any star whose signal is stronger than 15 times the $1\sigma$ noise level of a detector over that search period. Since on grounds of confidence the minimum identifiable signal should be about 10 times noise, our algorithm does only 50% worse than this and runs on a computer with achievable processing speed.