%0 Journal Article
%T M-TREE BASED PARALLEL ALGORITHM FOR SOLVING SPARSE TRIANGULAR SYSTEM ON DISTRIBUTED MEMORY MULTIPROCESSOR SYSTEMS<br>稀疏三角矩阵线性系统的基于树结构并行求解
%A Li Cheng
%A Tian Xinmin
%A Wang Dingxing
%A Zheng Weimin
%A <br>李程
%A 田新民
%A 王鼎兴
%A 郑纬民
%J 软件学报
%D 1995
%I 
%X 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.
%K Distributed memory multiprocessor system
%K sparse triangular system
%K sparse Cholesky factorization
%K elimination-tree<br>分布存储多机系统
%K 稀疏三角矩阵线性系统
%K Cholesky分解
%K 消元树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=DE6E53214F91C93203FEF8881C4EA4FD&yid=BBCD5003575B2B5F&vid=B31275AF3241DB2D&iid=5D311CA918CA9A03&sid=A33A8FD1432A4C3E&eid=5CB576B96D187F64&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=13