An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
From MaRDI portal
Parallel numerical computation (65Y05) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Randomized algorithms (68W20) Analysis of algorithms (68W40) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Cites work
- scientific article; zbMATH DE number 3686229 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- A randomized Kaczmarz algorithm with exponential convergence
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- An improved data stream summary: the count-min sketch and its applications
- Analyzing random permutations for cyclic coordinate descent
- Approximate solution of systems of linear equations†
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Linear algebra on high performance computers
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- Practical sketching algorithms for low-rank matrix approximation
- Probability. Theory and examples.
- Random permutations fix a worst case for cyclic coordinate descent
- Randomized extended Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Sketching as a tool for numerical linear algebra
- Smallest singular value of a random rectangular matrix
- Stochastic reformulations of linear systems: algorithms and convergence theory
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The method of projections for finding the common point of convex sets
Cited in
(5)- A weighted randomized sparse Kaczmarz method for solving linear systems
- Solving, tracking and stopping streaming linear inverse problems
- Statistical inference of constrained stochastic optimization via sketched sequential quadratic programming
- Randomized Block Adaptive Linear System Solvers
- Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification
This page was built for publication: An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997835)
