An efficient variant of the greedy block Kaczmarz algorithm for solving large linear systems
By exploiting the concept of row partitioning, we propose an efficient variant of the greedy block Kaczmarz algorithm for solving consistent large linear systems. The number of blocks is determined a priori through numerical experiments. The new algorithm works with a reduced linear system, which dr...
| Main Authors: | , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
AIMS Press
2024-01-01
|
| 丛编: | AIMS Mathematics |
| 主题: | |
| 在线阅读: | https://www.aimspress.com/article/doi/10.3934/math.2024122?viewType=HTML |