On the relaxed greedy deterministic row and column iterative methods

Nian-Ci Wu, Ling-Xia Cui and Qian Zuo

Applied Mathematics and Computation, 2022, vol. 432, issue C

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.

Keywords: Petrov-Galerkin conditions; Relaxed greedy selection; Row and column methods; Convergence analysis (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322004131
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:432:y:2022:i:c:s0096300322004131

DOI: 10.1016/j.amc.2022.127339

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().