2 research outputs found
Surrounding the solution of a Linear System of Equations from all sides
Suppose is invertible and we are looking for
the solution of . Given an initial guess , we show
that by reflecting through hyperplanes generated by the rows of , we can
generate an infinite sequence such that all elements
have the same distance to the solution, i.e. . If
the hyperplanes are chosen at random, averages over the sequence converge and
The bound does not
depend on the dimension of the matrix. This introduces a purely geometric way
of attacking the problem: are there fast ways of estimating the location of the
center of a sphere from knowing many points on the sphere? Our convergence rate
(coinciding with that of the Random Kaczmarz method) comes from averaging, can
one do better
A Weighted Randomized Kaczmarz Method for Solving Linear Systems
The Kaczmarz method for solving a linear system interprets such a
system as a collection of equations ,
where is the th row of , then picks such an equation and corrects
where is chosen so that the th
equation is satisfied. Convergence rates are difficult to establish. Assuming
the rows to be normalized, , Strohmer \& Vershynin
established that if the order of equations is chosen at random, converges exponentially. We prove that if the th row
is selected with likelihood proportional to , where , then converges faster than the purely random method. As , the method de-randomizes and explains, among other things, why the
maximal correction method works well. We empirically observe that the method
computes approximations of small singular vectors of as a byproduct