-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStrassensMatrixMultiplication.java
More file actions
138 lines (113 loc) · 4.13 KB
/
StrassensMatrixMultiplication.java
File metadata and controls
138 lines (113 loc) · 4.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
package com.mycompany.algorithm_final_project;
import java.util.Arrays;
import java.util.Scanner;
/**
*
* @author israkkayumchowdhury
*/
public class StrassensMatrixMultiplication {
public static int[][] matrixMultiply(int[][] A, int[][] B) {
int n = A.length;
// Base case: if the matrix are 1*1
if (n == 1) {
int[][] C = new int[1][1];
C[0][0] = A[0][0] * B[0][0];
return C;
}
// Splitting matrix into quadrants
int mid = n / 2;
int[][] A11 = new int[mid][mid];
int[][] A12 = new int[mid][mid];
int[][] A21 = new int[mid][mid];
int[][] A22 = new int[mid][mid];
int[][] B11 = new int[mid][mid];
int[][] B12 = new int[mid][mid];
int[][] B21 = new int[mid][mid];
int[][] B22 = new int[mid][mid];
for (int i = 0; i < mid; i++) {
for (int j = 0; j < mid; j++) {
A11[i][j] = A[i][j];
A12[i][j] = A[i][j + mid];
A21[i][j] = A[i + mid][j];
A22[i][j] = A[i + mid][j + mid];
B11[i][j] = B[i][j];
B12[i][j] = B[i][j + mid];
B21[i][j] = B[i + mid][j];
B22[i][j] = B[i + mid][j + mid];
}
}
// Recursive computation
int[][] P1 = matrixMultiply(A11, matrixSubtraction(B12, B22));
int[][] P2 = matrixMultiply(matrixAddition(A11, A12), B22);
int[][] P3 = matrixMultiply(matrixAddition(A21, A22), B11);
int[][] P4 = matrixMultiply(A22, matrixSubtraction(B21, B11));
int[][] P5 = matrixMultiply(matrixAddition(A11, A22), matrixAddition(B11, B22));
int[][] P6 = matrixMultiply(matrixSubtraction(A12, A22), matrixAddition(B21, B22));
int[][] P7 = matrixMultiply(matrixSubtraction(A11, A21), matrixAddition(B11, B12));
// Computing sub-matrices
int[][] C11 = matrixAddition(matrixSubtraction(matrixAddition(P5, P4), P2), P6);
int[][] C12 = matrixAddition(P1, P2);
int[][] C21 = matrixAddition(P3, P4);
int[][] C22 = matrixSubtraction(matrixSubtraction(matrixAddition(P5, P1), P3), P7);
// Combining sub-matrix to form the result
int[][] C = new int[n][n];
for (int i = 0; i < mid; i++) {
for (int j = 0; j < mid; j++) {
C[i][j] = C11[i][j];
C[i][j + mid] = C12[i][j];
C[i + mid][j] = C21[i][j];
C[i + mid][j + mid] = C22[i][j];
}
}
return C;
}
// matrix addition
public static int[][] matrixAddition(int[][] A, int[][] B) {
int n = A.length;
int[][] C = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
C[i][j] = A[i][j] + B[i][j];
}
}
return C;
}
// matrix subtraction
public static int[][] matrixSubtraction(int[][] A, int[][] B) {
int n = A.length;
int[][] C = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
C[i][j] = A[i][j] - B[i][j];
}
}
return C;
}
public static void printMatrix(int[][] matrix){
for(int[] row : matrix){
System.out.println(Arrays.toString(row));
}
}
public void main_func() {
Scanner s = new Scanner(System.in);
System.out.print(" Enter the size of the matrices (n): ");
int n = s.nextInt();
System.out.print(" Enter the element of matrix A: ");
int[][] A = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
A[i][j] = s.nextInt();
}
}
System.out.print(" Enter the element of matrix B: ");
int[][] B = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
B[i][j] = s.nextInt();
}
}
int[][] result = matrixMultiply(A, B);
System.out.println("Resultant matrix: ");
printMatrix(result);
}
}