上双对角阵Moore-Penrose逆及其并行算法  

THE MOORE PENROSE INVERSE OF BIDIAGONAL MATRICES AND ITS PARALLEL ALGORITHM

作　　者：王国荣[1] 

机构地区：[1]上海师范大学

出　　处：《高等学校计算数学学报》1990年第1期14-23,共10页Numerical Mathematics A Journal of Chinese Universities

摘　　要：本文首先指出n阶上双对角阵之Moore-Penrose逆有一个简单的结构,然后给出一个而向SIMD机的计算上双对角阵Moore-Penrose逆的并行算法,使用n台处理机,能在O(n·「logn」)步中算出。其速度增长倍数为O(n/「logn」),它与并行Greville算法相同,但就计算上双对角阵之Moore-Penrose逆而言,算法3.1的运算步数少于算法4.1。In this paper,the Moore-Penrose inverse of upper bidiagonal matrices of order n is showed to have a simple structure.A parallel algorithm facing the SIMD type machine for computing the Moore-Penrose inverse of upper bidiagonal matrices is presented,it can be done in O(n[logn]) time steps using n processors and the speedup is 0(n/[logn]).This Speedup is the same as that of parallel Greville's algorithm.But the time steps are less than that of the parallel Greville's algorithm for computing the Moore-penrose inverse of upper bidiagonal matrices.

关 键 词：上双对角阵 逆阵 并行算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]