Single projection Kaczmarz extended algorithms

From MaRDI portal



Abstract: To find the least squares solution of a very large and inconsistent system of equations, one can employ the extended Kaczmarz algorithm. This method simultaneously removes the error term, such that a consistent system is asymptotically obtained, and applies Kaczmarz iterations for the current approximation of this system. For random corrections of the right hand side and Kaczmarz updates selected at random, convergence to the least squares solution has been shown. We consider the deterministic control strategies, and show convergence to a least squares solution when row and column updates are chosen according to the almost-cyclic or maximal-residual choice.


The extended Kaczmarz algorithm provides a tool for searching the least squares solution of a large inconsistent system of equations. It is known that the original Kaczmarz method does not converge to the least squares solution in the inconsistent case. The extended version of the Kaczmarz algorithm adds a correction step in the form of an orthogonal projection on the \(i\)-th hyperplane. When the projection indices are selected at random, the so-called randomized extended Kaczmarz algorithm converges in expectation to the minimal norm solution and convergence rates can be obtained. The presented paper introduces two deterministic control schemes, the maximal-residual and the almost cyclic control scheme and shows convergence to the least squares solution.



Cites work


Cited in
(39)








This page was built for publication: Single projection Kaczmarz extended algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342879)