Tootfinder

Faster Linear Algebra Algorithms with Structured Random Matrices
Chris Cama\~no, Ethan N. Epperly, Raphael A. Meyer, Joel A. Tropp
https://arxiv.org/abs/2508.21189 https://

Faster Linear Algebra Algorithms with Structured Random Matrices
To achieve the greatest possible speed, practitioners regularly implement randomized algorithms for low-rank approximation and least-squares regression with structured dimension reduction maps. Despite significant research effort, basic questions remain about the design and analysis of randomized linear algebra algorithms that employ structured random matrices. This paper develops a new perspective on structured dimension reduction, based on the oblivious subspace injection (OSI) property. Th…