We study the relaxed Kaczmarz algorithm in Hilbert space. The connection with the non-relaxed algorithm is examined. In particular we give sufficient conditions when relaxation leads to the convergence of the algorithm independently of the relaxation coefficients.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-sm216-3-3, author = {Ryszard Szwarc and Grzegorz \'Swiderski}, title = {Kaczmarz algorithm with relaxation in Hilbert space}, journal = {Studia Mathematica}, volume = {215}, year = {2013}, pages = {237-243}, zbl = {1292.41013}, language = {en}, url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm216-3-3} }
Ryszard Szwarc; Grzegorz Świderski. Kaczmarz algorithm with relaxation in Hilbert space. Studia Mathematica, Tome 215 (2013) pp. 237-243. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm216-3-3/