A new greedy Kaczmarz algorithm for the solution of very large linear systems
From MaRDI portal
(Redirected from Publication:1726657)
The Kaczmarz numerical algorithm is a very popular iterative projection method for solving very large consistent systems of linear equations. However, this algorithm converges very slowly. A number of attempts have been made to speed up this procedure (see, for example [\textit{Z.-Z. Bai} and \textit{W.-T. Wu}, Linear Algebra Appl. 553, 252--269 (2018; Zbl 1391.65063)]). To improve the convergence of the Kaczmarz algorithm, the author examines a new modification with suitable selection of ``control sequence determined by a greedy rule and some suitable relaxation parameters. The algorithms: ``the GRK algorithm and ``the GK algorithm are described in details. Numerical experiments confirm the guaranteed convergence rate.
Recommendations
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- scientific article; zbMATH DE number 7295865
- Parametric greedy randomized Kaczmarz algorithm for solving large sparse linear systems
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- On convergence rate of the randomized Kaczmarz method
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- Randomized extended Kaczmarz for solving least squares
- Randomized Kaczmarz solver for noisy linear systems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Single projection Kaczmarz extended algorithms
Cited in
(67)- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
- Randomized double and triple Kaczmarz for solving extended normal equations
- On the regularization effect of stochastic gradient descent applied to least-squares
- Gauss-Seidel method with oblique direction
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- Kaczmarz method for fuzzy linear systems
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- Nonlinear greedy relaxed randomized Kaczmarz method
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection
- On greedy randomized average block Kaczmarz method for solving large linear systems
- On the relaxed greedy deterministic row and column iterative methods
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- A note on convergence rate of randomized Kaczmarz method
- Enhancement of the Kaczmarz algorithm with projection adjustment
- On convergence rate of the randomized Gauss-Seidel method
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
- A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
- A refinement of an iterative orthogonal projection method
- Projected randomized Kaczmarz methods
- Variant of greedy randomized Kaczmarz for ridge regression
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- On fast greedy block Kaczmarz methods for solving large consistent linear systems
- scientific article; zbMATH DE number 4128299 (Why is no real title available?)
- A weighted randomized Kaczmarz method for solving linear systems
- Parametric greedy randomized Kaczmarz algorithm for solving large sparse linear systems
- Surrounding the solution of a linear system of equations from all sides
- 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
- scientific article; zbMATH DE number 7295865 (Why is no real title available?)
- Randomized extended average block Kaczmarz for solving least squares
- scientific article; zbMATH DE number 7404478 (Why is no real title available?)
- A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Greedy Kaczmarz algorithm using optimal intermediate projection technique for coherent linear systems
- A partially greedy randomized extended Gauss-Seidel method for solving large linear systems
- Greedy Motzkin–Kaczmarz methods for solving linear systems
- Generalized Gearhart-Koshy acceleration for the Kaczmarz method
- A Deterministic Kaczmarz Algorithm for Solving Linear Systems
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems
- Deep Neural Networks for Solving Large Linear Systems Arising from High-Dimensional Problems
- Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems
- On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- The greedy randomized extended Kaczmarz algorithm for noisy linear systems
- On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
- On the adaptive deterministic block Kaczmarz method with momentum for solving large-scale consistent linear systems
- On weighted average fast block Kaczmarz methods for solving large consistent linear systems
- Research on Kaczmarz algorithm based on residual drive
- On steepest coordinate descent method for computing extreme eigenpairs of symmetric matrices
- The global block Kaczmarz method using double greedy strategy
- Kernel-algorithms in frame-approximations
- Maximal residual coordinate descent method with k-means clustering for solving large linear least-squares problems
- On global convergence of admissibly randomized coordinate descent method
- Randomized extended average block Kaczmarz method for inconsistent tensor equations under t-product
- A semi-randomized block Kaczmarz method with simple random sampling for large-scale consistent linear systems
- On multi-step partially randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
- On multi-step greedy Kaczmarz method for solving large sparse consistent linear systems
- On greedy randomized coordinate updating iteration methods for solving symmetric eigenvalue problems
- On randomized multiple row-action methods for linear feasibility problems
- On a deterministic block Kaczmarz-type method and its acceleration for the solution of large-scale linear systems
- A multi-step sketch-and-project solver for large sparse inconsistent linear systems: applications in signal and image processing
- Relaxed greedy randomized Kaczmarz with signal averaging for solving doubly-noisy linear systems
- A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces
This page was built for publication: A new greedy Kaczmarz algorithm for the solution of very large linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1726657)
