Cover Image

Fast randomized numerical rank estimation for numerically low-rank matrices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Meier, Maike, Nakatsukasa, Yuji
Format:	Preprint
Published:	2021
Subjects:	Numerical Analysis 65F55 (primary) 65F99, 68W20, 60B20 (secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved bounds for randomized Schatten norm estimation of numerically low-rank matrices
by: Chu, Ya-Chi, et al.
Published: (2024)

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

Low-rank approximation of parameter-dependent matrices via CUR decomposition
by: Park, Taejun, et al.
Published: (2024)

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

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

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

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

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

Fast Rank Adaptive CUR via a Recycled Small Sketch
by: Pritchard, Nathaniel, et al.
Published: (2025)

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

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

Randomized algorithms for streaming low-rank approximation in tree tensor network format
by: Bucci, Alberto, et al.
Published: (2024)

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

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

Randomized low-rank Runge-Kutta methods
by: Lam, Hei Yin, et al.
Published: (2024)

A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
by: Bucci, Alberto, et al.
Published: (2024)

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling
by: Jones, Eleanor, et al.
Published: (2025)

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

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

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

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

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

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

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

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

On Subsample Size of Quantile-Based Randomized Kaczmarz
by: Cai, Jian-Feng, et al.
Published: (2025)

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

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

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

Randomized methods for dynamical low-rank approximation
by: Carrel, Benjamin
Published: (2024)

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

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
by: Epperly, Ethan N.
Published: (2025)

Optimal Sensor Placement in Gaussian Processes via Column Subset Selection
by: Chen, Jessie, et al.
Published: (2026)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

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

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

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

Approximating Sparse Matrices and their Functions using Matrix-vector products
by: Park, Taejun, et al.
Published: (2023)

Fast and Accurate Interpolative Decompositions for General, Sparse, and Structured Tensors
by: Zhang, Yifan, et al.
Published: (2025)

Hybrid hierarchical matrices with adaptive mixed precision storage
by: Khan, Ritesh, et al.
Published: (2026)