Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
The matrix-vector complexity of
MichaÅ DereziÅski, Ethan N. Epperly, Raphael A. Meyer
Matrix--vector algorithms, particularly Krylov subspace methods, are widely viewed as the most effective algorithms for solving large systems of linear equations. This paper establ…
cs.DS2025
Does block size matter in randomized block Krylov low-rank approximation?
Tyler Chen, Ethan N. Epperly, Raphael A. Meyer +2
We study the problem of computing a rank- approximation of a matrix using randomized block Krylov iteration. Prior work has shown that, for block size or , a $(1…
cs.DS2025
Faster Linear Algebra Algorithms with Structured Random Matrices
Chris Camaño, Ethan N. Epperly, Raphael A. Meyer +1
To achieve the greatest possible speed, practitioners regularly implement randomized algorithms for low-rank approximation and least-squares regression with structured dimension re…