On the relaxed greedy deterministic row and column iterative methods
Numerical Analysis
2022-08-12 v1 Numerical Analysis
Abstract
For solving the large-scale linear system by iteration methods, we utilize the Petrov-Galerkin conditions and relaxed greedy index selection technique and provide two relaxed greedy deterministic row (RGDR) and column (RGDC) iterative methods, in which one special case of RGDR reduces to the fast deterministic block Kaczmarz method proposed in Chen and Huang (Numer. Algor., 89: 1007-1029, 2021). Our convergence analyses reveal that the resulting algorithms all have the linear convergence rates, which are bounded by the explicit expressions. Numerical examples show that the proposed algorithms are more effective than the relaxed greedy randomized row and column iterative methods.
Cite
@article{arxiv.2203.15186,
title = {On the relaxed greedy deterministic row and column iterative methods},
author = {Nian-Ci Wu and Ling-Xia Cui and Qian Zuo},
journal= {arXiv preprint arXiv:2203.15186},
year = {2022}
}