# An Asynchronous Parallel Randomized Kaczmarz Algorithm

arXiv: https://arxiv.org/abs/1401.4780 · HTML: https://mlsanity.com/paper/1401.4780/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Jan 2014.

## Built on by (most cited first, 3 of 3)

- [Distributed stochastic optimization with large delays](https://mlsanity.com/paper/2107.02919/) (2021)
- [An optimal scheduled learning rate for a randomized Kaczmarz algorithm](https://mlsanity.com/paper/2202.12224/) (2022)
- [Linear Discriminant Analysis with the Randomized Kaczmarz Method](https://mlsanity.com/paper/2211.05749/) (2022)

## 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.