首页 | 本学科首页   官方微博 | 高级检索  
     检索      

带状方程组q叉树MIMD算法
引用本文:崔蔚,曾宪雯,赵国伟.带状方程组q叉树MIMD算法[J].四川师范大学学报(自然科学版),2004,27(6):589-591.
作者姓名:崔蔚  曾宪雯  赵国伟
作者单位:中国工程物理研究院,工学院,四川,绵阳,621900
基金项目:中国工程物理研究院科学技术基金资助项目
摘    要:利用行处理法贪心方法和分治策略给出一个基于分布式存储MIMD一级q叉树树机模型求解任意带状方程组的并行迭代算法,证明算法对相容性带状方程组收敛并分析算法的通信复杂度。

关 键 词:带状方程组  行处理法贪心方法  分治策略  一级q叉树模型  分布式并行迭代算法
文章编号:1001-8395(2004)06-0589-03
修稿时间:2003年9月18日

MIMD Algorithm on q-nary Tree Model for Band System of Linear Algebraic Equations
CUI Wei,ZENG Xian-wen,ZHAO Guo-wei.MIMD Algorithm on q-nary Tree Model for Band System of Linear Algebraic Equations[J].Journal of Sichuan Normal University(Natural Science),2004,27(6):589-591.
Authors:CUI Wei  ZENG Xian-wen  ZHAO Guo-wei
Abstract: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.
Keywords:Band system  Row action method with greedy method  Divide and conquer strategy  1-th and q-nary tree model  Distributed Parallel iterative algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号