On the acceleration of Kaczmarz's method for inconsistent linear systems

DOI10.1016/0024-3795(90)90207-SzbMath0708.65033MaRDI QIDQ920573

Wilhelm Niethammer, Martin Hanke

Publication date: 1990

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

convergenceiterative methodrelaxation parametersinconsistent linear systemsKaczmarz's methodlarge sparse matrixChebyshev accelerationleast- squares solutionstrong underrelaxation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (29)

An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm ⋮ Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods ⋮ Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations ⋮ Randomized Kaczmarz with averaging ⋮ A self-correcting matrix iteration for the Moore-Penrose generalized inverse ⋮ Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation ⋮ Block Kaczmarz method with inequalities ⋮ Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems ⋮ Faster randomized block sparse Kaczmarz by averaging ⋮ On the relation between the randomized extended Kaczmarz algorithm and coordinate descent ⋮ Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma ⋮ Convergence rates for Kaczmarz-type regularization methods ⋮ A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility ⋮ Two-subspace projection method for coherent overdetermined systems ⋮ Accelerated Landweber iterations for the solution of ill-posed equations ⋮ Randomized block Kaczmarz method with projection for solving least squares ⋮ Randomized Kaczmarz solver for noisy linear systems ⋮ A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets ⋮ Accelerating the convergence of the method of alternating projections ⋮ A refinement of an iterative orthogonal projection method ⋮ Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm ⋮ Faster Randomized Block Kaczmarz Algorithms ⋮ A stationary iterative pseudoinverse algorithm ⋮ On the convergence of asynchronous paracontractions with application to tomographic reconstruction from incomplete data ⋮ A randomized Kaczmarz algorithm with exponential convergence ⋮ On relaxed greedy randomized iterative methods for the solution of factorized linear systems ⋮ Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin ⋮ Sampled limited memory methods for massive linear inverse problems ⋮ The adventures of a simple algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• Convergence properties of ART and SOR algorithms
• Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
• On the solution of singular linear systems of algebraic equations by semiiterative methods
• The angles between the null spaces of X rays
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• The Tchebychev iteration for nonsymmetric linear systems
• Projection method for solving a singular system of linear equations and its applications
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations

This page was built for publication: On the acceleration of Kaczmarz's method for inconsistent linear systems