arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.06018math.NAcs.NA
收藏

用于快速求解线性方程的预处理 GMRES

Preprocessed GMRES for fast solution of linear equations

Juan Zhang, Yiyi Luo

AI总结:

本文提出以 RPCG、ADI 和 Kaczmarz 为内迭代、BA-GMRES 为外迭代的预处理框架,并通过收敛分析与数值实验验证其在快速求解线性方程组中的有效性。

摘要:

本文主要介绍用于求解线性方程组的预处理算法。该算法采用三种算法作为内迭代,即 RPCG 算法、ADI 算法和 Kaczmarz 算法;随后使用 BA-GMRES 作为外迭代来求解线性方程组。这三种算法能够间接生成预处理矩阵,并将其用于方程组求解。此外,我们给出了相应的收敛性分析和数值算例。通过数值算例,我们证明了这些预处理方法的有效性和可行性。进一步地,在 Kaczmarz 算法中,我们引入了恒定步长和自适应步长,并将 Kaczmarz 算法的参数范围扩展到 α∈(0,∞)。我们还研究了使用不同步长时线性方程组的求解速度。数值算例表明,与无预处理的求解算法相比,恒定步长和自适应步长均具有更高的求解效率。

英文摘要:

The article mainly introduces preprocessing algorithms for solving linear equation systems. This algorithm uses three algorithms as inner iterations, namely RPCG algorithm, ADI algorithm, and Kaczmarz algorithm. Then, it uses BA-GMRES as an outer iteration to solve the linear equation system. These three algorithms can indirectly generate preprocessing matrices, which are used for solving equation systems. In addition, we provide corresponding convergence analysis and numerical examples. Through numerical examples, we demonstrate the effectiveness and feasibility of these preprocessing methods. Furthermore, in the Kaczmarz algorithm, we introduce both constant step size and adaptive step size, and extend the parameter range of the Kaczmarz algorithm to $α\in(0,\infty)$. We also study the solution rate of linear equation systems using different step sizes. Numerical examples show that both constant step size and adaptive step size have higher solution efficiency than the solving algorithm without preprocessing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑