The study of fast matrix multiplication on the Strassen and Winograd Strassen与Winograd快速矩阵乘法(FMM)研究
The Program Design of Fast Matrix Multiplication(FMM) 矩阵快速乘法的程序设计
On the other hand, we study asymptotically fast algorithm for rectangular matrix multiplication. 本文还研究了矩阵乘法的渐近快速算法。
Fast Algorithms for Complex Matrix Multiplication 复矩阵乘的快速算法
A decoding algorithm based on π transform and fast Hadamard transform changes the matrix multiplication to the addition, subtraction and position exchanging among the matrix elements, so reduces the demand of the instrument for computer. 基于π变换和快速阿达玛变换的解码算法,将矩阵乘法简化为矩阵元素间的加、减运算和位置交换,降低了仪器对微机系统的要求。