CAJ | 학술논문

利用五对角线性方程组的追赶法思想矩阵LU分解的方法,推导出任意带宽的大规模带状线性方程组的追赶法.理论推导表明：对于带宽为2t＋1的n阶带状线性方程组,该算法的运算量级为O（[2t2＋5t＋3]n）,存储量级为O[2（t＋1）n].数值实验表明：该算法比其他一些算法有明显的速度和内存优势.这极大地提高了解线性方程的速度.
이용오대각선성방정조적추간법사상구진LU분해적방법,추도출임의대관적대규모대상선성방정조적추간법.이론추도표명：대우대관위2t＋1적n계대상선성방정조,해산법적운산량급위O（[2t2＋5t＋3]n）,존저량급위O[2（t＋1）n].수치실험표명：해산법비기타일사산법유명현적속도화내존우세.저겁대지제고료해선성방정적속도.
Derives a forward elimination and backward substitution algorithm for lage-scale banded linear systems with any bandwidth,using ones with quinary diagonal linear systems.It is deduced theoretically that the operational level is O（[2t2＋5t＋3]n） and the storage level is O[2（t＋1）n] for a banded linear system with bandwidth 2t＋1 and order n.It is shown that in the numerical experiments this algorithm has some advantages in computational cost and need memory evidently,compared to others.It improves largely the rate of computing for solving linear systems.