摘要
给出了一种求解系数矩阵为块三对角的线性方程组的适合于ＭＩＭＤ型机的并行算法。从理论上证明了他与ＢＳＯＲ方法有相同的收敛速度，且与块Ｊａｃｏｂｉ方法有相同的并行性，并用一个算例在Ｍｕｌｔｉ－ＴｒａｎｓｐｕｔｅｒＳｙｓｔｅｍ模型机上作了计算，证明了他的有效性与可行性。
Yanis's 1990 paper [1] presents a parallel method for solving linear system of equations which involves block tridiagonal coefficient matrix. Ref.[1] approximates the level of methods used in P. R. China. But Yanis's method appears to be not sufficiently good in convergence. We now seek to improve convergence without sacrificing parallelism.Conversence is improved through suitable decomposition of matrix A in eq. (1), which represents a system of linear equations. After trying out several likely ways of decomposition, the best is that given by eq. (la). With this best way of decomposition and using the form of the iterative formula of the BSOR method, we establish the needed iterative formula, eq. (2). Then eqs. (3) through (5) are provided for carryins out computation required by our parallel algorithm. Our algorithm is suitable when multi - transputer system is employed as model machine.One illustrative example is given. The times consumed with our parallel algorithm and that of Ref. [1] are respectively 3.347 s and 4.187 s.These results indicate that our algorithm is effective and feasible.
出处
《西北工业大学学报》
EI
CAS
CSCD
北大核心
1996年第2期314-318,共5页
Journal of Northwestern Polytechnical University
基金
国家教委博土点基金
航空科学基金
关键词
块三对角
系数矩阵
并行算法
线性方程组
block tridiagonal coefficient matrix, parallel algorithm, BSOR method, multitransputer system
