| 带状方程组二叉树MIMD算法 |
| |
| 引用本文： | 杨本立,曾宪雯,李安志.带状方程组二叉树MIMD算法[J].西南师范大学学报(自然科学版),2004,29(1):29-34. |
| |
| 作者姓名： | 杨本立 曾宪雯 李安志 |
| |
| 作者单位： | 中国工程物理研究院,工学院,四川,绵阳,621900 |
| |
| 基金项目： | 中国工程物理研究院科学技术基金资助项目(20020656). |
| |
| 摘 要： | 利用行处理法和分治策略给出了一个基于分布式存储MIMD二叉树树机模型求解任意带状方程组的并行迭代算法,证明算法对相容性带状方程组收敛并分析算法的通信复杂度.
|
| 关 键 词： | 带状方程组 行处理法 分治策略 二叉树模型 分布式并行迭代算法 |
| 文章编号： | 1000-5471(2004)01-0029-06 |
| 修稿时间： | 2002年10月14 |
MIMD Algorithm on Binary Tree Model for Band System of Linear Algebraic Equations |
| |
| YANG Ben-li,ZENG Xian-wen,LI An-zhiInstitute of Technology,CAEP,Mianyang Sichuan ,China.MIMD Algorithm on Binary Tree Model for Band System of Linear Algebraic Equations[J].Journal of Southwest China Normal University(Natural Science),2004,29(1):29-34. |
| |
| Authors: | YANG Ben-li ZENG Xian-wen LI An-zhiInstitute of Technology CAEP Mianyang Sichuan China |
| |
| Institution: | YANG Ben-li,ZENG Xian-wen,LI An-zhiInstitute of Technology,CAEP,Mianyang Sichuan 621900,China |
| |
| Abstract: | 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. |
| |
| Keywords: | band system row action method divide-and-conquer strategy binary tree model distributed parallel iterative algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《西南师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《西南师范大学学报(自然科学版)》下载免费的PDF全文 |
