| 求解一类T型线性方程组的快速算法 |
| |
| 引用本文： | 蒋昌俊,阎春钢.求解一类T型线性方程组的快速算法[J].山东科技大学学报(自然科学版),1991(3). |
| |
| 作者姓名： | 蒋昌俊 阎春钢 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系，山东矿业学院应用数学与软件工程系 |
| |
| 摘 要： | 本文首先给出一个求解一类T型线性方程组的快速串行算法,它的复杂性是O(nlogn),比目前最好的O(n~2)算法复杂性要低。接着又指出了它的并行计算方案,在n台处理机的条件下,计算步数不超过O(logn),速度倍数是O(n),效率是O(1)。
|
| 关 键 词： | 线性方程组 算法 复杂性 |
A FAST ALGORITHM FOR SOLVING A KIND OF TYPE LINEAR EQUATION SYSTEMS |
| |
| Jiang Changjun, Yan Chungang.A FAST ALGORITHM FOR SOLVING A KIND OF TYPE LINEAR EQUATION SYSTEMS[J].Journal of Shandong Univ of Sci and Technol: Nat Sci,1991(3). |
| |
| Authors: | Jiang Changjun Yan Chungang |
| |
| Institution: | Dept. of Math. and Software Eng. |
| |
| Abstract: | In this paper, a fast series algorithm for solving a kind of T- type linear equation systems is given. Its complexityis O (nlogn) which is lower than that of the best O (n~2) algorithm. Then, a parallel algorithm is pointed out, its calculation steps are not more than O (logn) and its speed multiple is O (n), efficiency is O (1) under the condition of n processors are used |
| |
| Keywords: | linear equation system algorithm complexity |
| 本文献已被 CNKI 等数据库收录！ |
