Strassen要求阶n是2的幂,但这样的情况很少。
#include<iostream>
using namespace std;
class Matrix{
public:
int **m;
int n;
Matrix(){
m = NULL;
n = 0;
}
Matrix(int n){
this->n = n;
m = new int*[n];
for (int i = 0; i < n; i++){
m[i] = new int[n];
for (int j = 0; j < n; j++){
m[i][j] = 0;
}
}
}
void InitMatrix(){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
m[i][j] = rand() % 10;
}
}
}
};
//打印矩阵
void PrintMatrix(Matrix MatrixA, int N){
for (int i = 0; i < N; i++){
for (int j = 0; j < N; j++){
cout <<" "<<MatrixA.m[i][j] ;
}
cout << endl;
}
}
//矩阵加法
void Matrix_Sum(Matrix MatrixA, Matrix MatrixB, Matrix Sum_Matrix){
for (int i = 0; i < MatrixA.n; i++){
for (int j = 0; j < MatrixA.n; j++){
Sum_Matrix.m[i][j] = MatrixA.m[i][j] + MatrixB.m[i][j];
}
}
}
//传统矩阵乘法(朴素)
Matrix NormalMul_Matrix1(int N, Matrix MatrixA, Matrix MatrixB ){
Matrix MatrixC(MatrixA.n);
int M1 = (MatrixA.m[0][0] + MatrixA.m[1][1])*(MatrixB.m[0][0] + MatrixB.m[1][1]);
int M2 = (MatrixA.m[1][0] + MatrixA.m[1][1])*MatrixB.m[0][0];
int M3 = MatrixA.m[0][0] *(MatrixB.m[0][1] - MatrixB.m[1][1]);
int M4 = MatrixA.m[1][1] * (MatrixB.m[1][0] - MatrixB.m[0][0]);
int M5 = (MatrixA.m[0][0] + MatrixA.m[0][1])*MatrixB.m[1][1];
int M6 = (MatrixA.m[1][0] - MatrixA.m[0][0])*(MatrixB.m[0][0] + MatrixB.m[0][1]);
int M7 = (MatrixA.m[0][1] - MatrixA.m[1][1])*(MatrixB.m[1][0] + MatrixB.m[1][1]);
MatrixC.m[0][0] = M1 + M4 - M5 + M7;
MatrixC.m[0][1] = M3 + M5;
MatrixC.m[1][0] = M2 + M4;
MatrixC.m[1][1] = M1 + M3 - M2 + M6;
return MatrixC;
}
//分块矩阵,分割矩阵A,将第x行第y列的元素作为新的矩阵元素,分割出n阶矩阵
Matrix Split_Matrix(Matrix MatrixA, int x, int y, int n){
//int ** MatrixC = new int*[n];
//for (int i = 0; i < n; i++){
// MatrixC[i] = new int[n];//分配内存
//}
Matrix MatrixC(n);
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
MatrixC.m[i][j] = MatrixA.m[i + x][j + y];
}
}return MatrixC;
}
//采用分治思想处理输入偶数
//阶为偶数的矩阵相乘
Matrix Multi_Even(int N, Matrix MatrixA, Matrix MatrixB){
int n = N;
int m = 1;
//将矩阵拆为m*n,n为奇数,m为2的幂次
//例如N=6;6=3*2^1
/*(n&1)==1:判断n的最低位是不是1
如n=2 那么n的二进制00000010,1的二进制是00000001那么结果就是0,
n=3 那么n的二进制00000011,1的二进制是00000001 那么结果就是1,。 得出解决在判断是不是等于1
*/
while (!(n & 1)){
n >>= 1;//比特右移(>>)运算符,将 11100011 右移 3 比特,算术右移后成为 11111100,逻辑右移则为 00011100
m <<= 1;
}
//将A拆分成n^2个m阶矩阵,在arr_A中存储,即用二维数组arr_A中的每一项[i][j]存储矩阵
Matrix** arr_A = new Matrix*[n];
for (int i = 0; i < n; i++){
arr_A[i] = new Matrix[n];//分配内存
for (int j = 0; j < n; j++){
arr_A[i][j] = Split_Matrix(MatrixA, i*m, j*m, m);
}
}
//将B拆分成n^2个m阶矩阵,在arr_B中存储
Matrix** arr_B = new Matrix*[n];
for (int i = 0; i < n; i++){
arr_B[i] = new Matrix[n];//分配内存
for (int j = 0; j < n; j++){
arr_B[i][j] = Split_Matrix(MatrixB, i*m, j*m, m);
}
}
//初始化数组arr_C ,存储arr_A *arr_B 的结果
Matrix**arr_C = new Matrix*[n];
for (int i = 0; i < n; i++){
arr_C[i] = new Matrix[n];
for (int j = 0; j < n; j++){
arr_C[i][j] = Matrix(m);
}
}
//用传统方法将arr_A *arr_B ,存在arr_C
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
for (int k = 0; k < n; k++){
Matrix_Sum(arr_C[i][j], NormalMul_Matrix1(n, arr_A[i][k], arr_B[k][j]), arr_C[i][j]);
}
}
}
//声明一个矩阵C(m*n=N),将Matrix_Ctmp合并为一个矩阵C
/*int**MatrixC = new int*[m*n];
for (int i = 0; i < m*n; i++){
MatrixC[i] = new int[m*n];
}*/
Matrix MatrixC(m*n);
for (int i = 0; i < n; i++){//合并
for (int j = 0; j < n; j++){
for (int x = 0; x < m; x++){
for (int y = 0; y < m; y++){
MatrixC.m[x + i*m][y + j*m] = arr_C[i][j].m[x][y];
}
}
}
}
return MatrixC;
}
void main(){
int N;
cout << "请输入矩阵大小(必须是偶数): ";
cin >> N;
Matrix MatrixA(N), MatrixB(N), MatrixC;
Matrix MatrixC1;
MatrixA.InitMatrix();
MatrixB.InitMatrix();
cout << "A矩阵为:" << endl;
PrintMatrix(MatrixA, N);
cout << "B矩阵为:" << endl;
PrintMatrix(MatrixB, N);
cout << "n为非2的幂次,且为偶数的矩阵为:" << endl;
MatrixC = Multi_Even(N, MatrixA, MatrixB);
PrintMatrix(MatrixC, N);
system("pause"); //等待按任意键退出
}
运行结果如图:
参考文章:
https://wenku.baidu.com/view/01b01171cbaedd3383c4bb4cf7ec4afe04a1b11b.html