带状方程组q叉树MIMD算法  

MIMD Algorithm on q-nary Tree Model for Band System of Linear Algebraic Equations

作　　者：崔蔚[1] 曾宪雯[1] 赵国伟[1] 

机构地区：[1]中国工程物理研究院工学院,四川绵阳621900

出　　处：《四川师范大学学报（自然科学版）》2004年第6期589-591,共3页Journal of Sichuan Normal University（Natural Science）

基　　金：中国工程物理研究院科学技术基金资助项目

摘　　要：利用行处理法贪心方法和分治策略给出一个基于分布式存储MIMD一级q叉树树机模型求解任意带状方程组的并行迭代算法,证明算法对相容性带状方程组收敛并分析算法的通信复杂度.By using the row action method with greedy method and the divide-and-conquer strategy, this paper puts forward a parallel iterative algorithm based on the 1-th and q-nary 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 for the consistent band system. The communication complexity of the algorithm is also analized.

关 键 词：带状方程组 行处理法贪心方法 分治策略 一级q叉树模型 分布式并行迭代算法 

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