Acceleration of the BSS Algorithm

DOI10.48550/ARXIV.2610.35474MaRDI QIDQ7408785arXivFDO

Authors Tizian Sommerfeld

Publication date 26 October 2026

Published in arXiv

Tldr We propose two new implementations of the BSS algorithm with improved complexity for certain classes of frames. The first implementation reduces the complexity to O(σ^2nm^(2.5)) and the second one, for a specific class of Fourier-type frames on a full frequency cube, it is essentially O(σ^2m^2(n+m^(1.5))).

Full work available at URL https://doi.org/10.48550/ARXIV.2610.35474

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Sampling theory in information and communication theory (94A20)

arXiv classification

math.NA

Cites work

• A matrix hyperbolic cosine algorithm and applications
• Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
• Algebraic Graph Theory
• Constructing linear-sized spectral sparsification in almost-linear time
• Constructive subsampling of finite frames with applications in optimal function recovery
• Spectral sparsification and regret minimization beyond matrix multiplicative updates
• Updating the Inverse of a Matrix

This page was built for publication: Acceleration of the BSS Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7408785)