广义极小残差法中基于Arnoldi过程的多项式预处理方法
A Polynomial Preprocessing Method Based on the Arnoldi Process in the Generalized Minimal Residual Method
DOI: 10.12677/aam.2024.1310436, PDF,   
作者: 耿 硕:天津职业技术师范大学理学院,天津
关键词: GMRES算法线性方程组预处理稀疏矩阵GMRES Algorithm Systems of Linear Equations Preprocessing Sparse Matrices
摘要: 本文探讨了在求解大规模稀疏线性方程组时,多项式预处理技术在GMRES方法中的应用,提高了其计算效率和计算精度。我们分析了多项式预处理如何增加用于形成近似解的多项式的阶数。同时为了简化多项式预处理的过程,我们提出了基于Arnoldi过程的多项式预处理方法,通过直接利用Arnoldi基向量和递归系数来构造多项式 p( A )b ,从而有效避免了对多项式系数的直接计算。通过数值算例验证了这种方法简单且高效,为多项式预处理在GMRES中的应用提供了新的视角。
Abstract: In this paper, the application of polynomial preprocessing technology in the GMRES method is discussed when solving large-scale sparse linear equations, which improves its computational efficiency and computational accuracy. We analyze how polynomial preprocessing increases the order of the polynomial used to form an approximate solution. At the same time, in order to simplify the process of polynomial preprocessing, we propose a polynomial preprocessing method based on the Arnoldi process, which directly uses the Arnoldi basis vector and recursive coefficients to construct the polynomial p( A )b , which effectively avoids the direct calculation of the polynomial coefficients. Numerical examples verify that this method is simple and efficient, which provides a new perspective for the application of polynomial preprocessing technology in the GMRES method.
文章引用:耿硕. 广义极小残差法中基于Arnoldi过程的多项式预处理方法[J]. 应用数学进展, 2024, 13(10): 4555-4562. https://doi.org/10.12677/aam.2024.1310436

参考文献

[1] Saad, Y. (2003) Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics.
https://epubs.siam.org/doi/book/10.1137/1.9780898718003
[2] Saad, Y. (1981) Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems. Mathematics of Computation, 37, 105-126. [Google Scholar] [CrossRef
[3] Saad, Y. and Schultz, M.H. (1986) GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems. SIAM Journal on Scientific and Statistical Computing, 7, 856-869. [Google Scholar] [CrossRef
[4] Ghai, A., Lu, C. and Jiao, X. (2018) A Comparison of Preconditioned Krylov Subspace Methods for Large‐Scale Nonsymmetric Linear Systems. Numerical Linear Algebra with Applications, 26, e2215. [Google Scholar] [CrossRef
[5] Joubert, W. (1994) A Robust Gmres-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems. SIAM Journal on Scientific Computing, 15, 427-439. [Google Scholar] [CrossRef
[6] Ashby, S.F., Manteuffel, T.A. and Otto, J.S. (1992) A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems. SIAM Journal on Scientific and Statistical Computing, 13, 1-29. [Google Scholar] [CrossRef
[7] Arnoldi, W.E. (1951) The Principle of Minimized Iterations in the Solution of the Matrix Eigenvalue Problem. Quarterly of Applied Mathematics, 9, 17-29. [Google Scholar] [CrossRef