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

对称正定矩阵的并行LDLT分解算法实现
引用本文:张健飞,姜弘道.对称正定矩阵的并行LDLT分解算法实现[J].计算机工程与设计,2003,24(10):75-77.
作者姓名:张健飞  姜弘道
作者单位:河海大学土木工程学院,江苏,南京,210098
摘    要:基于网络机群这一新的并行环境和消息传递界面MPI给出了两种不带平方根的Cholesky并行分解算法,算法采用行卷帘存储方案和提前发送策略,从而减少了负载的不平衡,增加了计算通信的重叠,减少了通信时间。理论分析和数值试验均表明,算法具有较高的并行加速比和效率。

关 键 词:对称正定矩阵  串行算法  计算复杂度  并行LDL^T分解算法  并行计算机

Algorithms of parallel LDLT decomposition for SPD matrices and their implementation
ZHANG Jian-fei,JIANG Hong-dao.Algorithms of parallel LDLT decomposition for SPD matrices and their implementation[J].Computer Engineering and Design,2003,24(10):75-77.
Authors:ZHANG Jian-fei  JIANG Hong-dao
Abstract:This paper presents two parallel Cholesky decomposition algorithms without square root based on networked PC cluster, a kind of new parallel environment, and Message Passing Interface (MPI). With the scheme of row wrap storage and the strategy of send ahead, the algorithms reduce the load imbalance and communicational time and raise the lap of computation and com-munication. The theoretical analysis and numerical experiments show that the algorithms have high parallel speedup ratio and efficiency.
Keywords:symmetric positive definition matrix  Cholesky decomposition  parallel computation  networked PC cluster
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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