East Asian J. Appl. Math., 12 (2022), pp. 323-332.
Published online: 2022-02
Cited by
- BibTex
- RIS
- TXT
For solving large-scale sparse inconsistent linear systems by iteration methods, we introduce a relaxation parameter in the probability criterion of the greedy randomized augmented Kaczmarz method, obtaining a class of relaxed greedy randomized augmented Kaczmarz methods. We prove the convergence of these methods and estimate upper bounds for their convergence rates. Theoretical analysis and numerical experiments show that these methods can perform better than the greedy randomized augmented Kaczmarz method if the relaxation parameter is chosen appropriately.
}, issn = {2079-7370}, doi = {https://doi.org/10.4208/eajam.100821.251121 }, url = {http://global-sci.org/intro/article_detail/eajam/20256.html} }For solving large-scale sparse inconsistent linear systems by iteration methods, we introduce a relaxation parameter in the probability criterion of the greedy randomized augmented Kaczmarz method, obtaining a class of relaxed greedy randomized augmented Kaczmarz methods. We prove the convergence of these methods and estimate upper bounds for their convergence rates. Theoretical analysis and numerical experiments show that these methods can perform better than the greedy randomized augmented Kaczmarz method if the relaxation parameter is chosen appropriately.