BIT Numerical Mathematics

, Volume 50, Issue 2, pp 395-403

First online:

Randomized Kaczmarz solver for noisy linear systems

  • Deanna NeedellAffiliated withDepartment of Statistics, Stanford University Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


The Kaczmarz method is an iterative algorithm for solving systems of linear equations Ax=b. Theoretical convergence rates for this algorithm were largely unknown until recently when work was done on a randomized version of the algorithm. It was proved that for overdetermined systems, the randomized Kaczmarz method converges with expected exponential rate, independent of the number of equations in the system. Here we analyze the case where the system Ax=b is corrupted by noise, so we consider the system Axb+r where r is an arbitrary error vector. We prove that in this noisy version, the randomized method reaches an error threshold dependent on the matrix A with the same rate as in the error-free case. We provide examples showing our results are sharp in the general context.


Randomized algorithms Kaczmarz method Algebraic reconstruction technique

Mathematics Subject Classification (2000)

65F10 65F20 65F22