Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
From MaRDI portal
Publication:2085033
Recommendations
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- scientific article; zbMATH DE number 7295865
- On greedy randomized average block Kaczmarz method for solving large linear systems
Cites work
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Alternating projection methods.
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- Bounding the sensitivity of polynomial threshold functions
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- Fundamentals of Computerized Tomography
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Image reconstruction from a small number of projections
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- Matrix Analysis and Computations
- On convergence rate of the randomized Kaczmarz method
- On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
- On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Parallel iterative methods for sparse linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Probability and statistics for computer scientists
- 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
- Randomized double and triple Kaczmarz for solving extended normal equations
- Randomized extended average block Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized numerical linear algebra: Foundations and algorithms
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Sampling. Design and analysis
- The University of Florida sparse matrix collection
- Variant of greedy randomized Kaczmarz for ridge regression
Cited in
(13)- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems
- scientific article; zbMATH DE number 7295865 (Why is no real title available?)
- Greedy Motzkin–Kaczmarz methods for solving linear systems
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- On randomized sampling Kaczmarz method with application in compressed sensing
- A residual-based surrogate hyperplane extended Kaczmarz algorithm for large least squares problems
- The multi-step randomized Kaczmarz algorithms for solving large consistent linear equations
- A quantile-based block Kaczmarz algorithm for solving large consistent linear systems
- Accelerating randomized surrounding method with momentum for consistent linear systems
- On multi-step greedy Kaczmarz method for solving large sparse consistent linear systems
- A block coordinate descent linear least squares solver by quantile statistics
- Deterministic row-action methods for inconsistent linear system: semiconvergence analysis and augmented least-squares solvers
This page was built for publication: Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085033)
