Kaczmarz algorithm in Hilbert space
Studia Mathematica, Tome 169 (2005) no. 2, pp. 123-132
Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences
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.
Mots-clés :
the kaczmarz algorithm reconstruct element hilbert space given inner products element given sequence vectors main result characterizes sequences vectors leading reconstruction element space generalizes results kwapie mycielski
Affiliations des auteurs :
Rainis Haller 1 ; Ryszard Szwarc 2
@article{10_4064_sm169_2_2,
author = {Rainis Haller and Ryszard Szwarc},
title = {Kaczmarz algorithm in {Hilbert} space},
journal = {Studia Mathematica},
pages = {123--132},
publisher = {mathdoc},
volume = {169},
number = {2},
year = {2005},
doi = {10.4064/sm169-2-2},
language = {de},
url = {http://geodesic.mathdoc.fr/articles/10.4064/sm169-2-2/}
}
Rainis Haller; Ryszard Szwarc. Kaczmarz algorithm in Hilbert space. Studia Mathematica, Tome 169 (2005) no. 2, pp. 123-132. doi: 10.4064/sm169-2-2
Cité par Sources :