扩展循环约简算法的理论分析
Theoretical analysis of the extended cyclic reduction algorithm
摘要:
采用Swarztrauber在1974年提出的扩展循环约简算法求解块三对角线性系。本文填补了在推广的循环约简算法中,用牛顿法计算矩阵多项式$B_{i}^{(r)}$关于三对角矩阵的零点的理论结果的空白。同时,对求解块三对角方程组的扩展循环约简算法进行了向前误差分析。要达到这两个目的,临界点要找出矩阵多项式$B_{i}^{(r)}$的零点是系数矩阵的主子矩阵的特征值。
英文摘要:
The extended cyclic reduction algorithm developed by Swarztrauber in 1974 was used to solve the block-tridiagonal linear system. The paper fills in the gap of theoretical results concerning the zeros of matrix polynomial $B_{i}^{(r)}$ with respect to a tridiagonal matrix which are computed by Newton's method in the extended cyclic reduction algorithm. Meanwhile, the forward error analysis of the extended cyclic reduction algorithm for solving the block-tridiagonal system is studied. To achieve the two aims, the critical point is to find out that the zeros of matrix polynomial $B_{i}^{(r)}$ are eigenvalues of a principal submatrix of the coefficient matrix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。