On fast greedy block Kaczmarz methods for solving large consistent linear systems

Abstract

A fast greedy block Kaczmarz method combined with general greedy strategy and average technique are proposed for solving large consistent linear systems. Theoretical analysis of the convergence of the proposed method is given in detail. Numerical experiments show that the proposed methods are efficient and faster than the existing methods.