摘要
给出了一种沿对角线双向收缩法解系数矩阵为严格块对角占优矩阵的线性方程组,这种算法与经典的LU分解算法进行了比较,例子说明了算法的有效性.
In this paper, biforward berrevent algorithm along the diagonal for block linear equation which coefficient is diagonal block strictly diagonally dominant matrix was given . this algorithm and the classic LU decomposition algorithm equire about the same amount of work. some numerical examples are presented to verify the efficiency of the algorithm.
出处
《贵州师范大学学报（自然科学版）》
CAS
2012年第3期72-74,83,共4页
Journal of Guizhou Normal University：Natural Sciences
基金
贵州省科学技术基金资助项目(黔科合(2010)3174)
关键词
块状矩阵
严格块对角占优矩阵
双向收缩
block banded matrix
diagonal block strictly diagonally dominant matrix
biforward berrevent
