Randomized numerical linear algebra: Foundations and algorithms

From MaRDI portal
Publication:5887823

DOI10.1017/S0962492920000021MaRDI QIDQ5887823

Joel A. Tropp, Per-Gunnar Martinsson

Publication date: 14 April 2023

Published in: Acta Numerica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.01387



Related Items

Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures, T-product tensors. II: Tail bounds for sums of random T-product tensors, Stochastic algorithms for self-consistent calculations of electronic structures, Three matrix factorizations from the steps of elimination, Randomized Spectral Clustering in Large-Scale Stochastic Block Models, Improved Variants of the Hutch++ Algorithm for Trace Estimation, Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition, Sketching for a low-rank nonnegative matrix approximation: numerical study, Zeroth-order optimization with orthogonal random directions, A fast direct boundary element method for 3D acoustic problems based on hierarchical matrices, A hybrid probabilistic domain decomposition algorithm suited for very large-scale elliptic PDEs, Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions, A literature survey of matrix methods for data science, Learning high-dimensional parametric maps via reduced basis adaptive residual networks, On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations, Krylov-Aware Stochastic Trace Estimation, Randomized Block Adaptive Linear System Solvers, Randomized Low-Rank Approximation for Symmetric Indefinite Matrices, An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation, Principled interpolation of Green's functions learned from data, Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting, CECM: a continuous empirical cubature method with application to the dimensional hyperreduction of parameterized finite element models, Pass-efficient truncated UTV for low-rank approximations, HODLR\(d\)D: a new black-box fast algorithm for \(N\)-body problems in \(d\)-dimensions with guaranteed error bounds. Applications to integral equations and support vector machines, A low-rank update for relaxed Schur complement preconditioners in fluid flow problems, Low-rank nonnegative tensor approximation via alternating projections and sketching, Fast randomized numerical rank estimation for numerically low-rank matrices, Efficient Error and Variance Estimation for Randomized Matrix Computations, The method of randomized Bregman projections for stochastic feasibility problems, A fast randomized algorithm for computing an approximate null space, Randomized Nyström Preconditioning, Learning to Forecast Dynamical Systems from Streaming Data, XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation, Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization, Derivative-informed neural operator: an efficient framework for high-dimensional parametric derivative learning, Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition, GMRES algorithms over 35 years, Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning, Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices, Randomized block Krylov methods for approximating extreme eigenvalues, Efficient Algorithms for Eigensystem Realization Using Randomized SVD, Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems, LU and CR Elimination


Uses Software


Cites Work