| 计算加权Moore-Penrose逆A+M,N的一个改进的并行算法 |
| |
| 引用本文： | 王国荣,魏益民.计算加权Moore-Penrose逆A+M,N的一个改进的并行算法[J].上海师范大学学报(自然科学版),2000,29(1). |
| |
| 作者姓名： | 王国荣 魏益民 |
| |
| 作者单位： | 1. 上海师范大学,数学科学学院,上海,200234
2. 上海复旦大学,数学系,上海,200433 |
| |
| 基金项目： | NNSFC!(199710 57，1990 10 0 6 ) |
| |
| 摘 要： | 利用PREPARTAFP和SARWATEDV6] 的一些结果 ,给出一个计算加权Moore Penrose逆A MN 的改进的并行算法 ,改善了文献 8]中提出的算法。在与PREPARTAFP和SARWATEDV文 6 ]中相同的假设下证明了改进的并行算法的时间复杂性和处理机台数分别为 T =0 ((logn) 2 ) , P =max m/n 2 nα/logn ,2r1 / 2 nα(logrlogn)时空积 (成本最优性 ) T× P小于T×P(T和P分别为 8]中原有并行算法的时间复杂性和处理机台数 )。
|
| 关 键 词： | 并行算法 时间复杂性 加权Moore-Penrose逆 |
An Improved Parallel Algorithm for Computing the Weighted Moore-Penrose Inverse A+M,N |
| |
| WANG Guo-rong,WEI Yi-min.An Improved Parallel Algorithm for Computing the Weighted Moore-Penrose Inverse A+M,N[J].Journal of Shanghai Normal University(Natural Sciences),2000,29(1). |
| |
| Authors: | WANG Guo-rong WEI Yi-min |
| |
| Abstract: | We give an improved parallel algorithm for computing the weighted Moore-Penrose inverse A+M,N by using some results of PREPARTATA F P and SARWATE D V6] and modifying the algorithm of WANG Guo-rong and LU Sen-quan8].We show that with the same assumption as that given by PPEPARATA F P and SARWATE D V,the time complexity and the number of processors following the improved parallel algorithm are.(T)=0((logn)2)and (P)=max{「m/n(」) 2na/logn,2r1/2na/logrlogn} respectively.The cost-optimality (P)*(T) is less than P*T (T and P are the time compleity and the number of processors accompanying the origimal parallel algorithm). |
| |
| Keywords: | parallel algorithm time complexity weighted Moore Penrose inverse |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
