| 2^k阶矩阵乘的快速—普通混合算法 |
| |
| 引用本文： | 周德俊,邢永丽,林彦芬.2^k阶矩阵乘的快速—普通混合算法[J].河北省科学院学报,1999,16(2):25-30. |
| |
| 作者姓名： | 周德俊 邢永丽 林彦芬 |
| |
| 作者单位： | 1. 石家庄经济学院
2. 河北省科学院应用数学研究所 |
| |
| 基金项目： | 石家庄经济学院自然科学基金 |
| |
| 摘 要： | 从实际应用角度分析W算法用于2k阶矩阵乘的计算时间,发现混合算法是1个更优秀的算法.它与快速算法同阶.计算时间与快速算法计算时间之比为1:2.3.且从k＝6开始就优于普通算法.这些结果,已为计算实践证实.
|
| 关 键 词： | 快速算法 矩阵乘法 |
A FAST--COMMON MIXING ALGORITHM ON MULTIPLICATION OF 2k ORDER MATRIX |
| |
| Zhou Dejun,Xing Yongli,Lin Yenfen.A FAST--COMMON MIXING ALGORITHM ON MULTIPLICATION OF 2k ORDER MATRIX[J].Journal of The Hebei Academy of Sciences,1999,16(2):25-30. |
| |
| Authors: | Zhou Dejun Xing Yongli Lin Yenfen |
| |
| Institution: | Zhou Dejun Xing Yongli Lin Yenfen |
| |
| Abstract: | From the practical point of view,the calculative time of the w-algorithm on 2 k order matrix multiplication is studied.We find that the mixing algorithm so called z-algorithm,which is of the same order as the w-algorithm,is better than it and takes only 1/2.3 of the time it takes.In the meanwhile,it's superior to the common algorithm from k=6.Above results are proved by the calculating practice in the paper. |
| |
| Keywords: | Fast algorithm Multiplication of matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
