摘要
本文讨论了求解密集型线性方程组的两种并行算法。这两种算法都在下上单元(LU)分解。法的基础上使用了前向和后向置换进行的。这些算法在数值上是稳定的,并在顺序平衡机上用各种处理程序进行试验,都得到良好效果。
In this paper two parallel algorithms for solving dense linear equations are discussed. The algorithms are based on LU-decomposition followed by for-ward and back-ward substitutions.The algorithms are numerically stable and have been tested on the Sequent Balance Machine with efficient utilization of all processors.
出处
《应用数学和力学》
CSCD
北大核心
1996年第12期1077-1083,共7页
Applied Mathematics and Mechanics
关键词
理论时耗估价
线性方程组
顺序算法
并行算法
LU decomposition, for-ward and back-ward substitutions, MIMD machine, multi-tasking, theoretical cost