An Asynchronous Parallel Randomized Kaczmarz Algorithm
Not on the map. Why?
Abstract (arXiv)
We describe an asynchronous parallel variant of the randomized Kaczmarz (RK) algorithm for solving the linear system Ax=b. The analysis shows linear convergence and indicates that nearly linear speedup can be expected if the number of processors is bounded by a multiple of the number of rows in A.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Jan 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2.
3 papers.