文件名称:strassen
介绍说明－－下载内容均来自于网络，请自行研究使用
Strassen要求阶n是2的幂，但这样的情况很少。对任一偶数n，总有 n=m*2k, 将矩阵分为m*m个的2k阶矩阵。小矩阵用Strassen相乘，大矩阵用传统算法。设计出偶数阶矩阵相乘的算法。
-Strassen requires order n is a power of 2, but this situation is seldom. On either an even number n, out of a total of n = m* 2k, the matrix is divided into m* m th order 2k matrix. The small matrices Strassen multiplying large matrix with traditional algorithms. Even order matrix multiplication algorithm design.
-Strassen requires order n is a power of 2, but this situation is seldom. On either an even number n, out of a total of n = m* 2k, the matrix is divided into m* m th order 2k matrix. The small matrices Strassen multiplying large matrix with traditional algorithms. Even order matrix multiplication algorithm design.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Cpp1.cpp