A Randomized Solver for Linear Systems with Exponential Convergence

Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital signal processing. Despite the popularity of this method, useful theoretical estimates for its rate of convergence are still scarce. We introduce a randomized version of the Kaczmarz method for overdetermined linear systems and we prove that it converges with expected exponential rate. Furthermore, this is the first solver whose rate does not depend on the number of equations in the system. The solver does not even need to know the whole system, but only its small random part. It thus outperforms all previously known methods on extremely overdetermined systems. Even for moderately overdetermined systems, numerical simulations reveal that our algorithm can converge faster than the celebrated conjugate gradient algorithm.

• Type: Conference
• Year: 2006
• Where: APPROX
• Authors: Thomas Strohmer, Roman Vershynin
• Keywords: Algorithms, APPROX 2006, Kaczmarz Method, Linear Systems, Useful Theoretical Estimates