Convergence acceleration for the iterative solution of the equations X = AX + f
Convergence acceleration for the iterative solution of the equations X = AX + f
复制标题
DOI：
10.1016/0045-7825(77)90004-4
复制
发表时间：
1977-02
影响因子：
7.2
通讯作者：
M. Mesina
中科院分区：
文献类型：
--
作者：
M. Mesina
本文提出了一种加速求解线性方程组X =AX+f的收敛迭代过程的方法，当A的特征值绝对值大于1的个数不是很大时，该方法也适用于发散迭代格式。如果矩阵A由于广泛的存储要求而没有被明确地构造，并且如果不可能使用相对于A在复平面中的特征值的位置而设计的算法（诸如Chebyshev和Lanzcos多项式方法），则该方法是特别有利的。
A method is presented for accelerating the convergent iterative procedures of solving the system of linear equationsX=AX+f.The method is also applicable to divergent iterative schemes if the number of eigenvalues ofAthat are greater in absolute value than unity is not very large. The method is particularly advantageous if the matrixAhas not been explicitly constructed because of extensive storage requirements and if it is not possible to use the alhorithms (such as the Chebyshev and Lanzcos polynomial methods) which are designed with respect to the position of eigenvalues ofAin the complex plane.