Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · gr-qc/9905018

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

Bernard F. Schutz·M. Alessandra Papa
View original source ↗Read source document ↗Export metadata ↓

Abstract

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σ$ 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.

Explore related subjects

gr-qc

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bernard F. Schutz, M. Alessandra Papa. 1999-05-06. End-to-end algorithm for hierarchical area searches for long-duration GW sources for GEO 600. https://arxiv.org/abs/gr-qc/9905018

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

An upper bound on the minimum orbital period of black holes

Previous research has focused on establishing lower bounds on the minimum orbital period of black holes. In this work, we explore the complementary question of whether an upper bound exists for the minimum orbital period of black holes. We investigate the minimum orbital periods of three types of black holes: Schwarzschild, Reissner-Nordström and Kerr-Newman black holes. We find that the minimum orbital period of these black holes is bounded by an upper limit $T_{min} \leqslant 6\sqrt{3}πM$, where $M$ is the black hole mass. Our results suggest that this upper bound on the minimum orbital period may be a general property in black hole spacetimes.

gr-qc↗
arXiv2026

Bounds on the minimum orbital period in the background of 5-dimensional charged black holes

In this paper, we study the upper and lower bounds on the minimum orbital period of 5-dimensional charged black holes. Our results indicate that the upper bound of the minimum orbital period corresponds to non-charged black holes, while the lower bound is achieved in the case of maximally charged black holes. We further establish precise analytical expressions for the upper and lower bounds of the minimum orbital period. Our findings provide valuable insights into 5-dimensional charged black holes and help constrain theoretical gravity models.

gr-qc↗
arXiv2026

Analysis of minimum orbital periods around d-dimensional charged black holes

This paper investigates the bounds on the minimum orbital period for test objects around d-dimensional charged black holes in asymptotically flat spacetimes. We derive the exact critical radius and the minimum orbital period. We then prove analytically that the minimum orbital period decreases strictly as the charge of the black hole increases. Thus, the upper limit is reached for an uncharged black hole, while the lower limit is attained for a maximally charged one, and the two bounds take the closed form $\frac{2π(d-2)}{d-3}[(d-2)M]^{\frac{1}{d-3}}\leqslant T_{min} \leqslant 2π\sqrt{\frac{d-1}{d-3}}\,[(d-1)M]^{\frac{1}{d-3}}$. Since the minimum period equals $2π$ times the shadow radius, the upper bound is equivalently a universal upper bound on the shadow radius. These results improve our understanding of dynamics around d-dimensional black holes and impose constraints on candidate gravity theories.

gr-qc↗