On fast greedy block Kaczmarz methods for solving large consistent linear systems
Numerical Analysis
2022-10-18 v3 Numerical Analysis
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.
Cite
@article{arxiv.2210.05128,
title = {On fast greedy block Kaczmarz methods for solving large consistent linear systems},
author = {Aqin Xiao and Junfeng Yin and Ning Zheng},
journal= {arXiv preprint arXiv:2210.05128},
year = {2022}
}
Comments
11 pages, 1 figure