Commit ·
a256f36
1
Parent(s): 6affa24
Create app.py
Browse files
app.py
ADDED
|
@@ -0,0 +1,117 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from math import ceil, log
|
| 2 |
+
import time
|
| 3 |
+
import random
|
| 4 |
+
import numpy as np
|
| 5 |
+
import matplotlib.pyplot as plt
|
| 6 |
+
|
| 7 |
+
def add(A, B):
|
| 8 |
+
A = np.asarray(A)
|
| 9 |
+
B = np.asarray(B)
|
| 10 |
+
return A + B
|
| 11 |
+
|
| 12 |
+
def subtract(A, B):
|
| 13 |
+
A = np.asarray(A)
|
| 14 |
+
B = np.asarray(B)
|
| 15 |
+
return A - B
|
| 16 |
+
|
| 17 |
+
def joinQuadrants(q11,q12,q21,q22):
|
| 18 |
+
top = np.concatenate((q11, q12), axis=1)
|
| 19 |
+
bottom = np.concatenate((q21, q22), axis=1)
|
| 20 |
+
joinedMatrix = np.concatenate((top, bottom), axis=0)
|
| 21 |
+
|
| 22 |
+
return joinedMatrix
|
| 23 |
+
|
| 24 |
+
|
| 25 |
+
def strassen_matrix_multiply(A, B):
|
| 26 |
+
n = len(A)
|
| 27 |
+
|
| 28 |
+
if n <= 2:
|
| 29 |
+
return classic_matrix_multiply(A, B)
|
| 30 |
+
else:
|
| 31 |
+
mid = n // 2
|
| 32 |
+
|
| 33 |
+
a11 = A[0:mid, 0:mid]
|
| 34 |
+
a12 = A[mid:n, 0:mid]
|
| 35 |
+
a21 = A[0:mid, mid:n]
|
| 36 |
+
a22 = A[mid:n, mid:n]
|
| 37 |
+
|
| 38 |
+
b11 = B[0:mid, 0:mid]
|
| 39 |
+
b12 = B[mid:n, 0:mid]
|
| 40 |
+
b21 = B[0:mid, mid:n]
|
| 41 |
+
b22 = B[mid:n, mid:n]
|
| 42 |
+
|
| 43 |
+
m1 = strassen_matrix_multiply(add(a11, a22), add(b11, b22))
|
| 44 |
+
m2 = strassen_matrix_multiply(add(a21, a22), b11)
|
| 45 |
+
m3 = strassen_matrix_multiply(a11, subtract(b12, b22))
|
| 46 |
+
m4 = strassen_matrix_multiply(a22, subtract(b21, b11))
|
| 47 |
+
m5 = strassen_matrix_multiply(add(a11, a12), b22)
|
| 48 |
+
m6 = strassen_matrix_multiply(subtract(a21, a11), add(b11, b12))
|
| 49 |
+
m7 = strassen_matrix_multiply(subtract(a12, a22), add(b21, b22))
|
| 50 |
+
|
| 51 |
+
c12 = add(m3, m5)
|
| 52 |
+
c21 = add(m2, m4)
|
| 53 |
+
c11 = subtract(add(add(m1, m4), m7), m5)
|
| 54 |
+
c22 = subtract(add(add(m1, m3), m6), m2)
|
| 55 |
+
|
| 56 |
+
C = joinQuadrants(c11,c12,c21,c22)
|
| 57 |
+
|
| 58 |
+
return C
|
| 59 |
+
|
| 60 |
+
def classic_matrix_multiply(A, B):
|
| 61 |
+
C = [[0 for row in range(len(A))] for col in range(len(A))]
|
| 62 |
+
for i in range(len(A)):
|
| 63 |
+
for j in range(len(B[0])):
|
| 64 |
+
for k in range(len(B)):
|
| 65 |
+
C[i][j] += A[i][k] * B[k][i]
|
| 66 |
+
return C
|
| 67 |
+
|
| 68 |
+
def randomMatrix(n):
|
| 69 |
+
return np.random.randint(100, size=(n, n))
|
| 70 |
+
|
| 71 |
+
def measure_time(n_values):
|
| 72 |
+
strassen_times = []
|
| 73 |
+
standard_times = []
|
| 74 |
+
for n in n_values:
|
| 75 |
+
A = randomMatrix(n)
|
| 76 |
+
B = randomMatrix(n)
|
| 77 |
+
# Вимірюємо час для алгоритму Штрассена-Вінограда
|
| 78 |
+
start_time = time.time()
|
| 79 |
+
strassen_matrix_multiply(A, B)
|
| 80 |
+
strassen_time = time.time() - start_time
|
| 81 |
+
strassen_times.append(strassen_time)
|
| 82 |
+
|
| 83 |
+
|
| 84 |
+
# Вимірюємо час для стандартного алгоритму множення
|
| 85 |
+
start_time = time.time()
|
| 86 |
+
classic_matrix_multiply(A, B)
|
| 87 |
+
standard_time = time.time() - start_time
|
| 88 |
+
standard_times.append(standard_time)
|
| 89 |
+
|
| 90 |
+
return strassen_times, standard_times
|
| 91 |
+
|
| 92 |
+
# Число рядків матриць: 4, 16, 64, 256, 1024, 4096
|
| 93 |
+
n_values = [4, 16, 16, 64, 256, 1024, 4096]
|
| 94 |
+
|
| 95 |
+
strassen_times, standard_times = measure_time(n_values)
|
| 96 |
+
|
| 97 |
+
# Вивести результати у вигляді таблиці)
|
| 98 |
+
print("Розмір матриці (n) | Час виконання (с) (Strassen) | Час виконання (с) (Standard)")
|
| 99 |
+
print("-" * 65)
|
| 100 |
+
for i, n in enumerate(n_values):
|
| 101 |
+
print(f"{n:<19} | {strassen_times[i]:<28.6f} | {standard_times[i]:.6f}")
|
| 102 |
+
|
| 103 |
+
|
| 104 |
+
# Побудова графіків
|
| 105 |
+
plt.figure(figsize=(10, 6))
|
| 106 |
+
plt.xscale('log', base=2)
|
| 107 |
+
plt.yscale('log', base=2)
|
| 108 |
+
plt.plot(n_values, strassen_times, label='Strassen Algorithm')
|
| 109 |
+
plt.plot(n_values, standard_times, label='Standard Algorithm')
|
| 110 |
+
plt.xlabel('log2(n) - Розмір матриці (n)')
|
| 111 |
+
plt.ylabel('log2(T(n)) - Час виконання (с)')
|
| 112 |
+
plt.legend()
|
| 113 |
+
plt.title('Порівняння алгоритмів множення матриць')
|
| 114 |
+
plt.grid(True)
|
| 115 |
+
|
| 116 |
+
# Відображення графіку
|
| 117 |
+
plt.show()
|