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
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- How to generate random matrices from the classical compact groups
- CUR matrix decompositions for improved data analysis
- A mathematical introduction to compressive sensing
- On the stability and accuracy of least squares approximations
- Restricted isometries for partial random circulant matrices
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Fundamentals of Stein's method
- Toward a unified theory of sparse dimensionality reduction in Euclidean space
- Gaussian phase transitions and conic intrinsic volumes: steining the Steiner formula
- Kac's walk on \(n\)-sphere mixes in \(n\log n\) steps
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Freedman's inequality for matrix martingales
- Estimating the algorithmic variance of randomized ensembles via the bootstrap
- User-friendly tail bounds for sums of random matrices
- Tracking join and self-join sizes in limited storage
- A comparison principle for functions of a uniformly random subspace
- From Steiner formulas for cones to concentration of intrinsic volumes
- A fast algorithm for the inversion of general Toeplitz matrices
- On interpolation and integration in finite-dimensional spaces of bounded functions
- Interpolation via weighted \(\ell_{1}\) minimization
- A fast randomized algorithm for the approximation of matrices
- A randomized Kaczmarz algorithm with exponential convergence
- Spectral analysis of large dimensional random matrices
- Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
- A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
- A simplified neuron model as a principal component analyzer
- On the bootstrap of \(U\) and \(V\) statistics
- A new formula for k-statistics
- Pseudo-skeleton approximations by matrices of maximal volume
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Random vectors in the isotropic position
- The space complexity of approximating the frequency moments
- Random rotations: Characters and random walks on \(SO(N)\)
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Construction and arithmetics of \(\mathcal H\)-matrices
- Latent semantic indexing: A probabilistic analysis
- Improved bounds for sparse recovery from subsampled random convolutions
- Spectrum estimation from samples
- An introduction to finite tight frames
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Multidimensional butterfly factorization
- Row products of random matrices
- The Schur complement and its applications
- A fast direct solver for boundary integral equations in two dimensions
- UTV tools: Matlab templates for rank-revealing UTV decompositions
- On the distribution of the largest eigenvalue in principal components analysis
- Finding frequent items in data streams
- The geometry of graphs and some of its algorithmic applications
- The cut-off phenomenon for random reflections
- The convex geometry of linear inverse problems
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- Concentration inequalities for random tensors
- On spectral and numerical properties of random butterfly matrices
- Numerically safe Gaussian elimination with no pivoting
- Efficient algorithms for CUR and interpolative matrix decompositions
- A block QR algorithm and the singular value decomposition
- On the convergence to equilibrium of Kac's random walk on matrices
- Efficient sampling methods for discrete distributions
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Matrix concentration inequalities via the method of exchangeable pairs
- Fast linear algebra is stable
- Gaussian elimination is not optimal
- Positive definite functions on spheres
- Matrix Algorithms
- A DEIM Induced CUR Factorization
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- Frequent Directions: Simple and Deterministic Matrix Sketching
- A Randomized Blocked Algorithm for Efficiently Computing Rank-revealing Factorizations of Matrices
- Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Computational Advertising: Techniques for Targeting Relevant Ads
- The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Randomized algorithms for the low-rank approximation of matrices
- A fast randomized algorithm for overdetermined linear least-squares regression
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- An Algorithm for the Principal Component Analysis of Large Data Sets
- Randomized Algorithms for Matrices and Data
- 10.1162/15324430260185619
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Algorithm 971
- Revisiting Asynchronous Linear Solvers
- Low-Rank Approximation and Regression in Input Sparsity Time
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- Extensions of Lipschitz mappings into a Hilbert space
- Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- Randomized Iterative Methods for Linear Systems
- Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing
- On sparse reconstruction from Fourier and Gaussian measurements
- Fast computation of low-rank matrix approximations
- Sampling from large matrices
- The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
- A Randomized Algorithm for Principal Component Analysis
- Normal Approximation by Stein’s Method
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- Relative-Error $CUR$ Matrix Decompositions
- A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators
- Eigenvalues and Condition Numbers of Random Matrices
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Random Fourier Series with Applications to Harmonic Analysis. (AM-101)
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Approximating Matrix Multiplication for Pattern Recognition Tasks
- The QLP Approximation to the Singular Value Decomposition
- Computing rank-revealing QR factorizations of dense matrices
- Downdating the Rank-Revealing URV Decomposition
- Templates for the Solution of Algebraic Eigenvalue Problems
- Strong converse for identification via quantum channels
- Improved Bounds for Small-Sample Estimation
- Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
- Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature
- Faster Kernel Ridge Regression Using Sketching and Preconditioning
- Randomized algorithms in numerical linear algebra
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Stability of the Lanczos Method for Matrix Function Approximation
- High-Dimensional Probability
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start
- Optimal weighted least-squares methods
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
- Sequential Sampling for Optimal Weighted Least Squares Approximations in Hierarchical Spaces
- Faster Johnson–Lindenstrauss transforms via Kronecker products
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Randomized methods for matrix computations
- Twice-Ramanujan Sparsifiers
- Numerical linear algebra in the streaming model
- Fast computation of low rank matrix approximations
- Living on the edge: phase transitions in convex programs with random data
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- A universal sampling method for reconstructing signals with simple Fourier transforms
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- randUTV
- Universality laws for randomized dimension reduction, with applications
- ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
- Subspace Iteration Randomization and Singular Value Problems
- Turnstile streaming algorithms might as well be linear sketches
- Solving SDD linear systems in nearly m log 1/2 n time
- Butterfly Factorization
- Randomized Sparse Direct Solvers
- On the Compression of Low Rank Matrices
- Randomized QR with Column Pivoting
- Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra
- On the Equivalence between Kernel Quadrature Rules and Random Feature Expansions
- Optimal principal component analysis in distributed and streaming models
- Sparsified Cholesky and multigrid solvers for connection laplacians
- On Sketching Matrix Norms and the Top Singular Vector
- Fast monte-carlo algorithms for finding low-rank approximations
- Condition Numbers of Gaussian Random Matrices
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- An Introduction to Matrix Concentration Inequalities
- Numerical Linear Algebra
- Householder QR Factorization With Randomization for Column Pivoting (HQRRP)
- Interpolative Butterfly Factorization
- Compressing Rank-Structured Matrices via Randomized Sampling
- Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure
- A survey of direct methods for sparse linear systems
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- Methods of conjugate gradients for solving linear systems
- Compressed matrix multiplication
- A fast algorithm for particle simulations
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Graph Sparsification by Effective Resistances
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item