Orthogonal Blocking Kaczmarz Algorithm Based on Preprocessing Technology
CoRR(2024)
摘要
In this paper, we propose an orthogonal block wise Kaczmarz (POBK) algorithm
based on preprocessing techniques to solve large-scale sparse linear systems
Ax=f. Firstly, the Reverse Cuthill McKee Algorithm (RCM) algorithm is used to
preprocess the linear system, and then a new partitioning strategy is proposed
to divide orthogonal blocks into one category, in order to accelerate the
convergence rate of the Kaczmarz algorithm. The convergence of the POBK
algorithm has been theoretically proven, and a theoretical analysis of its
faster convergence is also provided. In addition, the experimental results
confirm that this algorithm is far superior to GRBK, RBK(k), and GREBK(k)
algorithms in both iteration steps (IT) and CPU time aspects.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要