On the Kaczmarz algorithm of approximation in infinite-dimensional spaces

23Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The Kaczmarz algorithm of successive projections suggests the following concept. A sequence (ek) of unit vectors in a Hilbert space is said to be effective if for each vector x in the space the sequence (xn) converges to x where (xn) is defined inductively: x0 = 0 and xn = xn-i + αnen, where αn = (x - xn-1, en). We prove the effectivity of some sequences in Hilbert spaces. We generalize the concept of effectivity to sequences of vectors in Banach spaces and we prove some results for this more general concept.

Cite

CITATION STYLE

APA

Kwapień, S., & Mycielski, J. (2001). On the Kaczmarz algorithm of approximation in infinite-dimensional spaces. Studia Mathematica, 148(1), 75–86. https://doi.org/10.4064/sm148-1-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free