Randomized Kaczmarz solver for noisy linear systems

Details Randomized Kaczmarz solver for noisy linear systems Randomized Kaczmarz solver for noisy linear systems

2009-02-05

arxiv.org/abs/0902.0958v2

BIT Numerical Mathematics, 2010. The original publication is available at www.springerlink.com.

Mathematics

Numerical Analysis

Scientific paper

10.1007/s10543-010-0265-5

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 where Ax is approximately b + 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.

Affiliated with

Also associated with

No associations

Rating

Randomized Kaczmarz solver for noisy linear systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Randomized Kaczmarz solver for noisy linear systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized Kaczmarz solver for noisy linear systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26246