###
DOI:
Journal of Software:1995.6(8):479-485

稀疏三角矩阵线性系统的基于树结构并行求解
李程,田新民,王鼎兴,郑纬民
(清华大学计算机科学与技术系,北京,100084)
M-TREE BASED PARALLEL ALGORITHM FOR SOLVING SPARSE TRIANGULAR SYSTEM ON DISTRIBUTED MEMORY MULTIPROCESSOR SYSTEMS
Li Cheng,Tian Xinmin,Wang Dingxing,Zheng Weimin
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2533   Download 3292
Received:December 26, 1993    Revised:April 21, 1994
> 中文摘要: 本文分析了大型稀疏矩阵线性方程组直接法求解的回代过程.基于改进的树结构(M—tree),提出了一种新的面向分布存储多机系统的稀疏三角矩阵线性系统并行Forward求解算法MPFS.文中讨论了M—tree的结构特征,并将所提出的并行求解算法与基于Elimination—tree求解算法进行了分析和比较.结果表明,MPFS算法不仅适用于更多的稀疏矩阵系统,而且在求解过程中可以开发Elimination—tree算法不能开发的计算并行性,从而使求解性能得到显著改进.
Abstract:In this paper, underlying the architecture of distributed memory.multiprocessors, a new forward substitution algorithm for the direct solution of large sparse linear system is presented. In the presented parallel algorithm, the Modified tree (M-tree) isproposed and adopted. Furthermore, a detailed comparison with the Elimination-tree based algorithm is carried out specially. The results show that more effective parallelism is exploited, and significant performance improvement can be obtained.
文章编号:     中图分类号:    文献标志码:
基金项目:本研究受到国家自然科学基金和国家863高技术项目资助. 本研究受到国家自然科学基金和国家863高技术项目资助.
Foundation items:
Reference text:

李程,田新民,王鼎兴,郑纬民.稀疏三角矩阵线性系统的基于树结构并行求解.软件学报,1995,6(8):479-485

Li Cheng,Tian Xinmin,Wang Dingxing,Zheng Weimin.M-TREE BASED PARALLEL ALGORITHM FOR SOLVING SPARSE TRIANGULAR SYSTEM ON DISTRIBUTED MEMORY MULTIPROCESSOR SYSTEMS.Journal of Software,1995,6(8):479-485