求解块三对角方程组的新算法  

A New Algorithm of Solving Block Tridiagonal Systems

作　　者：卢学飞[1] 徐仲[1] 

机构地区：[1]西北工业大学应用数学系,西安710072

出　　处：《数学的实践与认识》2007年第3期112-118,共7页Mathematics in Practice and Theory

基　　金：陕西省自然科学基金(2004CS110002)

摘　　要：根据块三对角矩阵的特殊分解,给出了求解块三对角方程组的新算法.该算法含有可以选择的参数矩阵,适当选择这些参数矩阵,可以使得计算精度较著名的追赶法高,甚至当追赶法失效时,由该算法仍可得到一定精度的解.A new algorithm of solving block tridiagonal systems is proposed, which is based on the special factorization of block tridiagonal matrix. The algorithm includes selective parameter-matrices. Proper selected parameter-matrices make new algorithm higher in precision than the famous Thomas algorithm. When the Thomas algorithm invalidate for some numerical examples, the new algorithm can solve.

关 键 词：块三对角矩阵 追赶法 

分 类 号：O241.8[理学—计算数学]