A class of fast greedy block Kaczmarz methods 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.

翻译：为解决大型一致线性系统,提出了一类快速贪婪的Kaczmarz区块方法,加上一般贪婪战略和平均技术,对拟议方法的趋同进行了理论分析。