A Novel Greedy Kaczmarz Method For Solving Consistent Linear Systems

Understand

With a quite different way to determine the working rows, we propose a novel greedy Kaczmarz method for solving consistent linear systems.

• Convergence analysis of the new method is provided.
• Numerical experiments show that, for the same accuracy, our method outperforms the greedy randomized Kaczmarz method and the relaxed greedy randomized Kaczmarz method introduced recently by Bai and Wu [Z.Z.
• BAI AND W.T.