| 一种只需4N~2单元的N阶矩阵快乘法及其实现 |
| |
| 引用本文： | 周六丁,程代杰. 一种只需4N~2单元的N阶矩阵快乘法及其实现[J]. 重庆大学学报(自然科学版), 1991, 0(3) |
| |
| 作者姓名： | 周六丁 程代杰 |
| |
| 作者单位： | 重庆大学计算机系(周六丁)，重庆大学计算机系(程代杰) |
| |
| 摘 要： | 本文改进了V.Strassen矩阵快乘算法,在时间复杂性保持相同,但将其空间复杂性从ON~(2.81)降至4N~2。文中还给出了改进算法的实现技术。
|
| 关 键 词： | 算法复杂性 算法分析 数据结构/矩阵乘法 |
A FAST NXN MATRIX MULTIPLICATION ALGORITHM WHICH ONLY N EEDS 4N~2 CELLS AND ITS REALIZATION |
| |
| Zhou Luding Chen Daijie. A FAST NXN MATRIX MULTIPLICATION ALGORITHM WHICH ONLY N EEDS 4N~2 CELLS AND ITS REALIZATION[J]. Journal of Chongqing University(Natural Science Edition), 1991, 0(3) |
| |
| Authors: | Zhou Luding Chen Daijie |
| |
| Affiliation: | Zhou Luding Chen Daijie |
| |
| Abstract: | This paper improves V. Strassen' s fast matrix multiplication algorithm, reducing its storage complexity from O(N2.81) to 4N2, and discuses about realization of improved algorithm. |
| |
| Keywords: | algorithm complexity algotrithm analysis data structure / matrix multi-plication |
| 本文献已被 CNKI 等数据库收录！ |
