Almost sure convergence of the Kaczmarz algorithm with random measurements (Q1934652)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost sure convergence of the Kaczmarz algorithm with random measurements |
scientific article; zbMATH DE number 6132224
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost sure convergence of the Kaczmarz algorithm with random measurements |
scientific article; zbMATH DE number 6132224 |
Statements
Almost sure convergence of the Kaczmarz algorithm with random measurements (English)
0 references
29 January 2013
0 references
The authors consider the classical Kaczmarz projection algorithm (cf. [\textit{S. Kaczmarz}, Bull. Int. Acad. Polon. Sci. A 1937, 355--357 (1937; Zbl 0017.31703)]) in which the measurement vectors (corresponding to the right hand side components) are random vectors with some additional properties. Under these hypothesis the authors prove that Kaczmarz algorithm almost surely converges exponentially fast and provide quantitative bounds for the associated convergence rates.
0 references
almost sure convergence
0 references
convergence rates
0 references
Kaczmarz projection algorithm
0 references
