Kaczmarz algorithm in Hilbert space
Rainis Haller ; Ryszard Szwarc
Studia Mathematica, Tome 166 (2005), p. 123-132 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

The aim of the Kaczmarz algorithm is to reconstruct an element in a Hilbert space from data given by inner products of this element with a given sequence of vectors. The main result characterizes sequences of vectors leading to reconstruction of any element in the space. This generalizes some results of Kwapień and Mycielski.

Publié le : 2005-01-01
EUDML-ID : urn:eudml:doc:284674 
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-sm169-2-2,
     author = {Rainis Haller and Ryszard Szwarc},
     title = {Kaczmarz algorithm in Hilbert space},
     journal = {Studia Mathematica},
     volume = {166},
     year = {2005},
     pages = {123-132},
     zbl = {1102.41031},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm169-2-2}
}

Rainis Haller; Ryszard Szwarc. Kaczmarz algorithm in Hilbert space. Studia Mathematica, Tome 166 (2005) pp. 123-132. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm169-2-2/