@Article{EAJAM-12-2,
author = {Wu, Wen-Ting},
title = {On Convergence of the Partially Randomized Extended Kaczmarz Method},
journal = {East Asian Journal on Applied Mathematics},
year = {2022},
volume = {12},
number = {2},
pages = {435--448},
abstract = {<p style="text-align: justify;">To complete the convergence theory of the partially randomized extended
Kaczmarz method for solving large inconsistent systems of linear equations, we give its
convergence theorem whether the coefficient matrix is of full rank or not, tall or flat.
This convergence theorem also modifies the existing upper bound for the expected solution error of the partially randomized extended Kaczmarz method when the coefficient
matrix is tall and of full column rank. Numerical experiments show that the partially
randomized extended Kaczmarz method is convergent when the tall or flat coefficient
matrix is rank deficient, and can also converge faster than the randomized extended
Kaczmarz method.</p>},
issn = {2079-7370},
doi = {https://doi.org/10.4208/eajam.290921.240122},
url = {https://global-sci.com/article/82475/on-convergence-of-the-partially-randomized-extended-kaczmarz-method}
}