A sketch-and-select Arnoldi process

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Cites Work

Title not available (Why is that?)
Best subset selection via a modern optimization lens
A mathematical introduction to compressive sensing
On the generation of Krylov subspace bases
Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
A fast randomized algorithm for the approximation of matrices
Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
KIOPS: a fast adaptive Krylov subspace solver for exponential integrators
Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
The effect of non-optimal bases on the convergence of Krylov subspace methods
A Krylov--Schur algorithm for large eigenproblems
Efficient and Stable Arnoldi Restarts for Matrix Functions Based on Quadrature
Computational Advertising: Techniques for Targeting Relevant Ads
The university of Florida sparse matrix collection
Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
Decoding by Linear Programming
Greed is Good: Algorithmic Results for Sparse Approximation
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
Jacobi’s Method is More Accurate than QR
Efficient computation of the DFT with only a subset of input or output points
Spectral Perturbation Bounds for Positive Definite Matrices
Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
Sparse Approximate Solutions to Linear Systems
On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Approximating the Matrix Exponential of an Advection-Diffusion Operator Using the Incomplete Orthogonalization Method
Stable signal recovery from incomplete and inaccurate measurements
The principle of minimized iterations in the solution of the matrix eigenvalue problem
Randomized Gram--Schmidt Process with Application to GMRES
Benchmarking optimization software with performance profiles.
Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
A survey of subspace recycling iterative methods
Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization