2000 character limit reached
On fast greedy block Kaczmarz methods for solving large consistent linear systems
Published 11 Oct 2022 in math.NA and cs.NA | (2210.05128v3)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.