摘要
本文对求实对称三对角矩阵的并行QR算法中有关线性递推的并行计算进行了改进,并在武汉大学研制的MIMD多微机分布并行系统Wudp—88上实现。改进后的并行QR算法的并行效率比原来提高约1倍,对并行系统处理机的台数没有限制,适用的范围更广。这个算法采取了必要的措施,减少了各台处理机由于等待数据消耗的机器时间。
The computation of some linear recurrence relations in aparllel QR algo rithm for symmetric tridiagonal matrices is improved. The improved algorit hm has been implemented on the MIMD multiple micro-computers distributed parallel system Wudp 88 of Wuhan University. Its parallel efficiency is doubled compared with the original algorithm. There is no restriction on the number of processors in the parallel system, so the algorithm can te applied to more general parallel systems. Some necessary measures are adopted to decrease the idleness or underutilization of processors in data taking.
出处
《武汉大学学报(自然科学版)》
CSCD
1991年第2期17-24,共8页
Journal of Wuhan University(Natural Science Edition)
基金
国家自然科学基金
关键词
矩阵
特征值
QR算法
并行系统
symmetric tridiagonal matrix
eigenvaluei parallel computat ion
QR algorithm
MIMD parallel system