Georgios Vretinaris | Searcharxiv

arXiv2025

A Low-Rank BUG Method for Sylvester-Type Equations

We introduce a low-rank algorithm inspired by the Basis-Update and Galerkin (BUG) integrator to efficiently approximate solutions to Sylvester-type equations. The algorithm can exploit both the low-rank structure of the solution as well as any sparsity present to reduce computational complexity. Even when a standard dense solver, such as the Bartels-Stewart algorithm, is used for the reduced Sylvester equations generated by our approach, the overall computational complexity for constructing and solving the associated linear systems reduces to O(kr(n^2+m^2 +mn + r^2)), for X in R^{m \times n}, where k is the number of iterations and r the rank of the approximation.

math.NA↗

arXiv2025

Robust and fast parameter estimation for gravitational waves from binary neutron star merger remnants

We present a robust and efficient methodology for parameter estimation of gravitational waves generated during the post-merger phase of binary neutron star mergers. Our approach leverages an analytic waveform model combined with empirical relations to predict prior ranges for the post-merger frequencies based on measurements of the chirp mass and effective tidal deformability in the inspiral phase. This enables robust inference of the main features of the post-merger spectrum, avoiding possible multi-modality induced by wide priors. Using waveforms derived from numerical relativity, we systematically validate our model across a broad spectrum of neutron star equations of state and mass configurations, demonstrating high fitting factors. Our method can be applied in future detections of gravitational waves from the post-merger phase with third-generation gravitational wave observatories. Furthermore, by integrating the Preconditioned Monte Carlo sampling method within the pocoMC framework, we achieve substantial computational acceleration compared to conventional Bayesian techniques.

gr-qc↗