Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
DOI10.1007/s40314-022-02044-5OpenAlexW4298125644MaRDI QIDQ2085033
Publication date: 14 October 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-022-02044-5
linear systemssimple random samplingKaczmarz methodrandomized Kaczmarz methodgreedy randomized Kaczmarz method
Hypothesis testing in multivariate analysis (62H15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- A randomized Kaczmarz algorithm with exponential convergence
- On convergence rate of the randomized Kaczmarz method
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- Randomized double and triple Kaczmarz for solving extended normal equations
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
- Variant of greedy randomized Kaczmarz for ridge regression
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Projection method for solving a singular system of linear equations and its applications
- Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
- On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
- Fundamentals of Computerized Tomography
- The university of Florida sparse matrix collection
- Randomized Iterative Methods for Linear Systems
- Image reconstruction from a small number of projections
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Probability and Statistics for Computer Scientists
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Matrix Analysis and Computations
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- Sampling
- Randomized numerical linear algebra: Foundations and algorithms
This page was built for publication: Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
