A note on Kaczmarz algorithm with remotest set control sequence

MaRDI QIDQ5223854zbMATH OpenFDO

Authors Constantin Popa

Publication date 18 July 2019

Full work available at URL https://arxiv.org/abs/1702.02729, http://aos.ro/wp-content/anale/MVol10Nr1Art.7.pdf

zbMATH Keywords

Kaczmarz algorithmremotest set control

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Abstract: In this paper we analyse the Kaczmarz projection algorithm with remotest set control of projection indices. According to this procedure, in each iteration the projection index is one which gives the maximal absolute value of the corresponding residual. We prove that for underdetermined full row rank systems and under some assumptions valid for problems arising in algebraic reconstruction of images in computerized tomography, this selection procedure has the property that each row index is selected at least once during the Kaczmarz algorithm iterations.

Recommendations

• On Remotest set and Random controls in Kaczmarz algorithm
• Convergence rates for Kaczmarz-type algorithms
• Single projection Kaczmarz extended algorithms
• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
• Constrained Kaczmarz extended algorithm for image reconstruction

Cited in

(2)

• Convergence rates for Kaczmarz-type algorithms
• On Remotest set and Random controls in Kaczmarz algorithm

This page was built for publication: A note on Kaczmarz algorithm with remotest set control sequence

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