摘要
提出了分布式存储环境下求解三对角线性方程组的一种并行算法 ,该算法基于“分而治之”的策略 ,高效地形成并求解其缩减方程组 ,避免不必要的冗余计算 .通过对计算量的仔细估计 ,较好地平衡了各处理机的负载 ;同时 ,充分利用了计算与通信重叠技术 ,减少处理机空闲时间 .分析了算法的复杂性 ,给出了在分布存储多计算机系统上的数值试验结果 .数值结果表明 ,算法的效率较迟利华和李晓梅的 DPP算法有较大的提高 .
A parallel algorithm for solving tridiagonal linear systems on distributed memory multicomputers is presented. The algorithm is based on the divide and conquer principle. The reduction system is formed and solved efficiently. The unnecessary redundancy computation is avoided. On account of carefully estimating the computation task, the loads of solving the system are evenly distributed among the processors. This algorithm makes full use of overlapping between computation and communication to decreas the amount of processors' idle time. The complexity of the algorithm is analyzed. The results of numerical experiments about the algorithm on a multicomputer are presented. The numerical results show that the efficiency of this algorithm is much higher than that of Chi Li hua and Li Xiao mei's DPP algorithm.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2000年第7期802-806,共5页
Journal of Computer Research and Development
基金
国家自然科学基金重点项目 !(项目编号 6993 3 0 3 0 )
国家"八六三"高技术研究发展计划基金资助!(项目编号 863 -3 0 6-ZD-0 1-0 3 -
关键词
分布式存储
三对角线性方程组
并行算法
distributed memory, tridiagonal linear system, parallel algorithm, multicomputer system
