On Multi-step Greedy Kaczmarz Method for Solving Large Sparse Consistent Linear Systems
摘要
Based on the greedy randomized Kaczmarz (GRK) method, we propose a multi-step greedy Kaczmarz method for solving large-scale consistent linear systems, utilizing multi-step projection techniques. Its convergence is proved when the linear system is consistent. Numerical experiments demonstrate that the proposed method is effective and more efficient than several existing classical Kaczmarz methods.