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

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

1999-05-06

arxiv.org/abs/gr-qc/9905018v1

Astronomy and Astrophysics

Astrophysics

General Relativity and Quantum Cosmology

7 pages, for proceedings of Jan 1999 Moriond meeting "Gravitational Waves and Experimental Gravity"

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

End-to-end algorithm for hierarchical area searches for long-duration GW sources for GEO 600 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with End-to-end algorithm for hierarchical area searches for long-duration GW sources for GEO 600, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and End-to-end algorithm for hierarchical area searches for long-duration GW sources for GEO 600 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-145703