带状方程组二叉树MIMD算法

MIMD Algorithm on Binary Tree Model for Band System of Linear Algebraic Equations

利用行处理法和分治策略给出了一个基于分布式存储MIMD二叉树树机模型求解任意带状方程组的并行迭代算法,证明算法对相容性带状方程组收敛并分析算法的通信复杂度.

Making use of the row action method and the divide-and-conquer strategy, a parallel iterative algorithm is put forward based on the binary tree machine model with MIMD computer of distributed memory, to solve arbitrary band system of linear algebraic equations. It is proved that the algorithm is convergence to the consistent band system. And the communication complexity of the algorithm is also discussed.