四川师范大学学报（自然科学版）2013，Vol.36Issue(1)：57-60,4.DOI:10.3969/j.issn.1001-8395.2013.01.012
三对角方程组通用性迭代解法
General Iteration Algorithm to Solve a Tridiagonal Equations
摘要
Abstract
An effective iterative algorithm to solve a tridiagonal equations of arbitrary compatibility is proposed based on reference (J. Sichuan Normal Univ. :Natural Sci. ,2008,31(2) : 187-188. ). The convergence of the algorithm is proved, and a parallel processing scheme and test cases are designed. The basic idea of this algorithm is as follows. Firstly, the coefficient matrix of a tridiagonal e-quation is divided into three groups such that all the row vectors in the same group are mutually orthogonal. Secondly, by compressing storage, the row vectors in the three groups are compressed into three row vectors. And finally, starting from the first group, the iteration is recycled among the three groups with the accelerated factor 1. The algorithm is convergent for any tridiagonal equation with arbitrary compatibility and is easily carried out parallel. Moreover, the algorithm can save storage space and especially suitable for solving large-scale and super-large tridiagonal equations.关键词
三对角方程组/相容性/并行迭代算法/加速因子Key words
tridiagonal equations/ compatibility/ parallel iterative algorithm/ accelerated factor分类
数理科学引用本文复制引用
李安志,任继念,崔蔚..三对角方程组通用性迭代解法[J].四川师范大学学报（自然科学版）,2013,36(1):57-60,4.基金项目
国家自然科学基金(10802081)资助项目 （10802081）
