Showing 1–20 of 23 results
/ Date/ Name
Jun 21, 2021Minimal Rank Completions for Overlapping BlocksFeb 18, 2026Fast, High-Accuracy, Randomized Nullspace Computations for Tall MatricesNov 13, 2019Graph-Induced Rank Structures and their RepresentationsJun 6, 2023Kernel quadrature with randomly pivoted CholeskyApr 20, 2024Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semi-separable least squaresApr 24, 2023Robust, randomized preconditioning for kernel ridge regressionOct 4, 2024Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted CholeskyApr 5, 2024The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolutionJun 5, 2024Fast randomized least-squares solvers can be just as accurate and stable as classical direct solversNov 7, 2023Fast and forward stable randomized algorithms for linear least-squares problemsNov 29, 2024Randomized Kaczmarz with tail averagingJan 19, 2023XTrace: Making the most of every sample in stochastic trace estimationDec 17, 2025Make the most of what you have: Resource-efficient randomized algorithms for matrix computationsAug 8, 2025Does block size matter in randomized block Krylov low-rank approximation?Apr 8, 2025Successive randomized compression: A randomized algorithm for the compressed MPO-MPS productOct 2, 2025Adaptive randomized pivoting and volume samplingOct 14, 2021A theory of quantum subspace diagonalizationAug 28, 2025Faster Linear Algebra Algorithms with Structured Random MatricesFeb 25, 2025Stable algorithms for general linear systems by preconditioning the normal equationsJul 13, 2022Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations