Treffer: Mismatched Adjoint Random Kaczmarz with Averaging.

The Randomized Kaczmarz with Mismatched Adjoint (RKMA) method is an algorithm that resolves the imprecision adjoint matrix of linear systems by using sequential updates, avoiding the utilization of parallel computation. In this study, we explore a parallel version of RKMA, which implements an independently updated weighted average. We analyze the convergence of RKMA under both overdetermined and underdetermined systems using the averaging method. Additionally, we empirically showcase its performance, revealing that the convergence rate escalates with the increase in the number of threads, while the convergence level for inconsistent systems decreases. [ABSTRACT FROM AUTHOR]

Copyright of Computational & Applied Mathematics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)