In this paper,we first provide a new convergence theorem for the greedy Kaczmarz(GK)method in reference[14].Secondly,in order to improve the efficiency of solving consistent linear equations,a new greedy block Kaczmarz(RDBK)method based on the greedy strat-egy of the GK method is proposed,and the convergence theorem of the RDBK method is provided.Finally,the numerical results demonstrate that the RDBK method is significantly superior to the GK method in terms of iteration steps and computation time.