Acceleration of Randomized Kaczmarz Method via the Johnson-Lindenstrauss Lemma

Details Acceleration of Randomized Kaczmarz Method via the Johnson-Lindenstrauss Lemma Acceleration of Randomized Kaczmarz Method via the Johnson-Lindenstrauss Lemma

2010-08-25

arxiv.org/abs/1008.4397v2

Mathematics

Numerical Analysis

Scientific paper

The Kaczmarz method is an algorithm for finding the solution to an overdetermined consistent system of linear equations Ax=b by iteratively projecting onto the solution spaces. The randomized version put forth by Strohmer and Vershynin yields provably exponential convergence in expectation, which for highly overdetermined systems even outperforms the conjugate gradient method. In this article we present a modified version of the randomized Kaczmarz method which at each iteration selects the optimal projection from a randomly chosen set, which in most cases significantly improves the convergence rate. We utilize a Johnson-Lindenstrauss dimension reduction technique to keep the runtime on the same order as the original randomized version, adding only extra preprocessing time. We present a series of empirical studies which demonstrate the remarkable acceleration in convergence to the solution using this modified approach.

Affiliated with

Also associated with

No associations

Rating

Acceleration of Randomized Kaczmarz Method via the Johnson-Lindenstrauss Lemma 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 Acceleration of Randomized Kaczmarz Method via the Johnson-Lindenstrauss Lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Acceleration of Randomized Kaczmarz Method via the Johnson-Lindenstrauss Lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703197