Optimal template placement for searches of gravitational waves from precessing compact binary coalescences

Download statistics - Document (COUNTER):

Indik, Nathaniel M: Optimal template placement for searches of gravitational waves from precessing compact binary coalescences. Hannover : Gottfried Wilhelm Leibniz Universität, Diss., 2018, 130 S. DOI: https://doi.org/10.15488/3412

Selected time period:


Sum total of downloads: 203

A new field of astronomy was opened up on Monday September 14th 2015, when the first detection of a Gravitational Wave was observed, GW150914. So far there have been no observations of gravitational waves produced from neutron-star--black-hole mergers. The observation of a neutron-star--black-hole merger would be significant because it would provide another way to study how compact binary coalescence gravitational wave signals relate to companion electromagnetic and neutrino emission signals. The difficulty in detecting precessing neutron-star--black-hole binaries (systems that allow for the full range of physical spin configurations) is that template banks for these precessing compact binary coalescence systems require many more templates than compact binary coalescence template banks that have been implemented previously. The purpose of the work presented in this thesis is to both improve the construction and efficiency of compact binary coalescence template banks. Template bank construction in the high dimensional precessing compact binary coalescence parameter spaces is complicated by the absence of a known analytic expression of mismatch inspiral-merger-ringdown metric. Previously, these restraints only permitted the use of the inefficient and slow to converge stochastic template placement algorithms. In this thesis, I constructed a template bank, the face-on-precessing template bank, over a subspace of this precessing neutron-star--black-hole template bank parameter space. I accomplished this by implementing a new algorithm for speeding up the convergence of the stochastic placement of these templates. I found that this subspace required 53 times more templates than the aligned-spin bank. Additionally, I developed an alternative template placement algorithm, the template nudging algorithm, to reposition compact binary coalescence templates into more effectual configurations in order to eliminate the effect of gridlines, artificially dense regions of the bank, that are characteristic of the hybrid template bank construction methods previously implemented in LIGO-Virgo compact binary coalescence searches. Finally, I developed a technique for constructing flat coordinates for compact binary coalescence template placements in high dimensional parameter spaces to ease in the construction of a fully precessing compact binary coalescence template bank.
License of this version: CC BY 3.0 DE
Document Type: doctoralThesis
Publishing status: publishedVersion
Issue Date: 2018
Appears in Collections:Fakultät für Mathematik und Physik

distribution of downloads over the selected time period:

downloads by country:

pos. country downloads
total perc.
1 image of flag of Germany Germany 180 88.67%
2 image of flag of China China 10 4.93%
3 image of flag of United States United States 3 1.48%
4 image of flag of Russian Federation Russian Federation 3 1.48%
5 image of flag of India India 2 0.99%
6 image of flag of Spain Spain 2 0.99%
7 image of flag of Netherlands Netherlands 1 0.49%
8 image of flag of Italy Italy 1 0.49%
9 image of flag of Belgium Belgium 1 0.49%

Further download figures and rankings:


Zur Erhebung der Downloadstatistiken kommen entsprechend dem „COUNTER Code of Practice for e-Resources“ international anerkannte Regeln und Normen zur Anwendung. COUNTER ist eine internationale Non-Profit-Organisation, in der Bibliotheksverbände, Datenbankanbieter und Verlage gemeinsam an Standards zur Erhebung, Speicherung und Verarbeitung von Nutzungsdaten elektronischer Ressourcen arbeiten, welche so Objektivität und Vergleichbarkeit gewährleisten sollen. Es werden hierbei ausschließlich Zugriffe auf die entsprechenden Volltexte ausgewertet, keine Aufrufe der Website an sich.

Search the repository