Cover Image

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Epperly, Ethan N.
Format:	Preprint
Published:	2025
Subjects:	Numerical Analysis Data Structures and Algorithms Computation 68W20, 65C05, 65F10, 65F20, 65F55
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster Linear Algebra Algorithms with Structured Random Matrices
by: Camaño, Chris, et al.
Published: (2025)

Fast and forward stable randomized algorithms for linear least-squares problems
by: Epperly, Ethan N.
Published: (2023)

Sharp analysis of sketched least squares and randomized low-rank approximation
by: Epperly, Ethan N., et al.
Published: (2026)

Adaptive randomized pivoting and volume sampling
by: Epperly, Ethan N.
Published: (2025)

Robust, randomized preconditioning for kernel ridge regression
by: Díaz, Mateo, et al.
Published: (2023)

Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
by: Epperly, Ethan N., et al.
Published: (2024)

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement
by: Dereziński, Michał, et al.
Published: (2026)

XTrace: Making the most of every sample in stochastic trace estimation
by: Epperly, Ethan N., et al.
Published: (2023)

Linear-Scaling Tensor Train Sketching
by: Cazeaux, Paul, et al.
Published: (2026)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
by: Persson, David, et al.
Published: (2023)

Quasi-optimal hierarchically semi-separable matrix approximation
by: Amsel, Noah, et al.
Published: (2025)

BOLT: Block-Orthonormal Lanczos for Trace estimation of matrix functions
by: Yeon, Kingsley, et al.
Published: (2025)

Efficient error and variance estimation for randomized matrix computations
by: Epperly, Ethan N., et al.
Published: (2022)

Oblivious Subspace Injection Is Not Enough for Relative Error
by: Townsend, Alex, et al.
Published: (2026)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
by: Persson, David, et al.
Published: (2025)

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
by: Guidotti, Nicolas L., et al.
Published: (2023)

GMRES with randomized sketching and deflated restarting
by: Burke, Liam, et al.
Published: (2023)

Relaxed Greedy Randomized Kaczmarz with Signal Averaging for Solving Doubly-Noisy Linear Systems
by: Zhang, Lu, et al.
Published: (2026)

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
by: Chen, Guan-Yu, et al.
Published: (2025)

Accelerating a restarted Krylov method for matrix functions with randomization
by: Guidotti, Nicolas L., et al.
Published: (2025)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
by: Lok, Jackie, et al.
Published: (2025)

Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
by: Yeon, Kingsley, et al.
Published: (2025)

Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semi-separable least squares
by: Wilber, Heather, et al.
Published: (2024)

A general framework for Krylov ODE residuals with applications to randomized Krylov methods
by: Krieger, Emil, et al.
Published: (2025)

Preconditioning via Randomized Range Deflation (RandRAND)
by: Balabanov, Oleg, et al.
Published: (2025)

Randomized flexible Krylov methods for $\ell_p$ regularization
by: Landman, Malena Sabaté, et al.
Published: (2025)

Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
by: Cortinovis, Alice, et al.
Published: (2024)

Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
by: Epperly, Ethan N., et al.
Published: (2026)

On a randomized small-block Lanczos method for large-scale null space computations
by: Kressner, Daniel, et al.
Published: (2024)

Sketched and truncated polynomial Krylov methods: Evaluation of matrix functions
by: Palitta, Davide, et al.
Published: (2023)

Detecting when one probe vector is enough for preconditioned log-determinant approximation
by: Cortinovis, Alice, et al.
Published: (2026)

Fast randomized numerical rank estimation for numerically low-rank matrices
by: Meier, Maike, et al.
Published: (2021)

Efficient Sketching-Based Summation of Tucker Tensors
by: Smith, Rudi, et al.
Published: (2026)

Optimal Krylov On Average
by: Luo, Qi, et al.
Published: (2025)

Randomized coupled decompositions
by: Begovic, Erna, et al.
Published: (2024)

Row-aware Randomized SVD with applications
by: Palitta, Davide, et al.
Published: (2024)

Parallel-in-time Multilevel Krylov Methods: A Prototype
by: Erlangga, Yogi A.
Published: (2023)

Improving Sketching Algorithms for Low-Rank Matrix Approximation via Sketch-Power Iterations
by: Chang, Chao, et al.
Published: (2026)

Efficient error estimators for Generalized Nyström
by: Lazzarino, Lorenzo, et al.
Published: (2026)

Randomized Large-Scale Quaternion Matrix Approximation: Practical Rangefinders and One-Pass Algorithm
by: Chang, Chao, et al.
Published: (2024)