.png){kind=icon}
.png){kind=icon}
Return
Accelerated Kaczmarz methods via randomized sketch techniques for solving consistent linear systems
.png){kind=icon}
PRE
AI
DOI：10.1007/s12190-025-02684-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Motivated by the randomized sketch to solve a variety of problems in scientific computation, we improve both the maximal weighted residual Kaczmarz method and the randomized block average Kaczmarz method using two new randomized sketch techniques. Besides, convergence analyses of the proposed methods are provided. Furthermore, we establish an upper bound for the discrepancy between the numerical solutions obtained via the proposed methods and those derived from the original approaches. Numerical experiments demonstrate that the new methods perform better than the existing ones in terms of the running time with the same accuracy.
Keywords:
Maximal weighted residual Kaczmarz method
Randomized average block Kaczmarz method
Randomized sketch
Journal
J
IF:
2.7
Papers:
169
Citations:
0