摘要
通过矩阵的分解,利用求解三对角线性方程组的有效方法——追赶法.探究其求解七对角线性方程组的算法,并对其算法在计算速度、占用内存方面进行估计.并用数值试验印证了相关结论.
By decomposing the matrix and using the catch -up method （an effective way to solve tridiagonal linear equations）, the paper investigates the algorithm to catch up seven diagonal linear equations, and evaluates its calculating speed and its memory. Numerical experiments have confirmed the relative conclusions as well.
出处
《绍兴文理学院学报》
2010年第10期1-5,12,共6页
Journal of Shaoxing University
关键词
对角线性方程组
非奇异
具非零元素链
对角占优
矩阵分解
追赶法
Diagonal linear equations
non - singular
non - zero element chain
diagonally dominant
decomposition of the matrix
catch - up method
