Papers › Fast Fisher Matrices and Lazy Likelihoods
Fast Fisher Matrices and Lazy Likelihoods
Neil J. Cornish
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Theoretical studies in gravitational wave astronomy often require the calculation of Fisher Information Matrices and Likelihood functions, which in a direct approach entail the costly step of computing gravitational waveforms. Here I describe an alternative technique that sidesteps the need to compute full waveforms, resulting in significant computational savings. I describe how related techniques can be used to speed up Bayesian inference applied to real gravitational wave data.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections