Two-subspace Projection Method for Coherent Overdetermined Systems

Details Two-subspace Projection Method for Coherent Overdetermined Systems Two-subspace Projection Method for Coherent Overdetermined Systems

2012-04-01

arxiv.org/abs/1204.0277v1

Mathematics

Numerical Analysis

Scientific paper

We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of linear equations. POCS methods have found many applications ranging from computer tomography to digital signal and image processing. The Kaczmarz method is one of the most popular solvers for overdetermined systems of linear equations due to its speed and simplicity. Here we introduce and analyze an extension of the Kaczmarz method that iteratively projects the estimate onto a solution space given by two randomly selected rows. We show that this projection algorithm provides exponential convergence to the solution in expectation. The convergence rate improves upon that of the standard randomized Kaczmarz method when the system has coherent rows. Experimental results confirm that in the coherent case our method significantly outperforms the randomized Kaczmarz method.

Affiliated with

Also associated with

No associations

Rating

Two-subspace Projection Method for Coherent Overdetermined 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 Two-subspace Projection Method for Coherent Overdetermined Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-subspace Projection Method for Coherent Overdetermined Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509215