Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems

For solving inconsistent linear systems of equations iteratively, we further generalize the greedy randomized augmented Kaczmarz (GRAK) algorithm by introducing a nonzero parameter in the involved augmented linear system of the above inconsistent linear system, obtaining a class of accelerated greed...

Full description

Saved in:

Bibliographic Details
Published in:	Applied numerical mathematics Vol. 195; pp. 142 - 156
Main Author:	Liu, Yong
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2024
Subjects:	Augmented linear systems Convergence property Greedy randomized augmented Kaczmarz Inconsistent linear systems Randomized extended Kaczmarz Randomized extended Kaczmarz Augmented linear systems Greedy randomized augmented Kaczmarz Convergence property Inconsistent linear systems
ISSN:	0168-9274, 1873-5460
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	For solving inconsistent linear systems of equations iteratively, we further generalize the greedy randomized augmented Kaczmarz (GRAK) algorithm by introducing a nonzero parameter in the involved augmented linear system of the above inconsistent linear system, obtaining a class of accelerated greedy randomized augmented Kaczmarz algorithms. These algorithms involve one iteration parameter whose special choice can recover the GRAK algorithm, as well as yield new ones. Theoretical analyses show that the new algorithms converge to the unique solution of the augmented linear system. Moreover, the optimal choice of the parameter involved and the corresponding convergence rates of the new algorithms are computed exactly. Numerical results show that our algorithms can be much more effective than the GRAK algorithm in terms of both iteration counts and computing times.
ISSN:	0168-9274 1873-5460
DOI:	10.1016/j.apnum.2023.10.002