A Solution to the Galactic Foreground Problem for LISA

Simple item page
dc.creatorCrowder, Jeff
dc.creatorCornish, Neil
dc.date2006-11-17
dc.date.accessioned2026-07-07T10:36:36Z
dc.date.available2026-07-07T10:36:36Z
dc.descriptionLow frequency gravitational wave detectors, such as the Laser Interferometer Space Antenna (LISA), will have to contend with large foregrounds produced by millions of compact galactic binaries in our galaxy. While these galactic signals are interesting in their own right, the unresolved component can obscure other sources. The science yield for the LISA mission can be improved if the brighter and more isolated foreground sources can be identified and regressed from the data. Since the signals overlap with one another we are faced with a ``cocktail party'' problem of picking out individual conversations in a crowded room. Here we present and implement an end-to-end solution to the galactic foreground problem that is able to resolve tens of thousands of sources from across the LISA band. Our algorithm employs a variant of the Markov Chain Monte Carlo (MCMC) method, which we call the Blocked Annealed Metropolis-Hastings (BAM) algorithm. Following a description of the algorithm and its implementation, we give several examples ranging from searches for a single source to searches for hundreds of overlapping sources. Our examples include data sets from the first round of Mock LISA Data Challenges.
dc.description19 pages, 27 figures
dc.identifierhttps://arxiv.org/abs/astro-ph/0611546
dc.identifierhttp://arxiv.org/abs/astro-ph/0611546
dc.identifierPhys.Rev.D75:043008,2007
dc.identifierdoi:10.1103/PhysRevD.75.043008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/180106
dc.subjectAstrophysics
dc.subjectGeneral Relativity and Quantum Cosmology
dc.titleA Solution to the Galactic Foreground Problem for LISA
dc.typetext

Files

Collections

arXiv