Create stressen.py
Browse files- stressen.py +167 -0
stressen.py
ADDED
|
@@ -0,0 +1,167 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
|
| 2 |
+
import numpy as np
|
| 3 |
+
|
| 4 |
+
num_addorsub=0
|
| 5 |
+
num_mul=0
|
| 6 |
+
num_assign=0
|
| 7 |
+
|
| 8 |
+
def matrix_add(matrix_a, matrix_b):
|
| 9 |
+
'''
|
| 10 |
+
:param matrix_a:
|
| 11 |
+
:param matrix_b:
|
| 12 |
+
:return:matrix_c=matrix_a+matrix_b
|
| 13 |
+
'''
|
| 14 |
+
rows = len(matrix_a) # get numbers of rows
|
| 15 |
+
columns = len(matrix_a[0]) # get numbers of cols
|
| 16 |
+
matrix_c = [list() for i in range(rows)] # build matrix 2d list
|
| 17 |
+
for i in range(rows):
|
| 18 |
+
for j in range(columns):
|
| 19 |
+
matrix_c_temp = matrix_a[i][j] + matrix_b[i][j]
|
| 20 |
+
global num_addorsub,num_assign
|
| 21 |
+
num_addorsub = num_addorsub + 1
|
| 22 |
+
num_assign = num_assign + 1
|
| 23 |
+
matrix_c[i].append(matrix_c_temp)
|
| 24 |
+
return matrix_c
|
| 25 |
+
|
| 26 |
+
|
| 27 |
+
def matrix_minus(matrix_a, matrix_b):
|
| 28 |
+
'''
|
| 29 |
+
:param matrix_a:
|
| 30 |
+
:param matrix_b:
|
| 31 |
+
:return:matrix_c=matrix_a-matrix_b
|
| 32 |
+
'''
|
| 33 |
+
rows = len(matrix_a)
|
| 34 |
+
columns = len(matrix_a[0])
|
| 35 |
+
matrix_c = [list() for i in range(rows)]
|
| 36 |
+
for i in range(rows):
|
| 37 |
+
for j in range(columns):
|
| 38 |
+
matrix_c_temp = matrix_a[i][j] - matrix_b[i][j]
|
| 39 |
+
global num_addorsub,num_assign
|
| 40 |
+
num_addorsub = num_addorsub + 1
|
| 41 |
+
num_assign=num_assign + 1
|
| 42 |
+
matrix_c[i].append(matrix_c_temp)
|
| 43 |
+
return matrix_c
|
| 44 |
+
|
| 45 |
+
|
| 46 |
+
def matrix_divide(matrix_a, row, column):
|
| 47 |
+
'''
|
| 48 |
+
:param matrix_a:
|
| 49 |
+
:param row:
|
| 50 |
+
:param column:
|
| 51 |
+
:return: matrix_b=matrix_a(row,column) to divide matrix_a
|
| 52 |
+
'''
|
| 53 |
+
rows = len(matrix_a)
|
| 54 |
+
columns = len(matrix_a[0])
|
| 55 |
+
matrix_b = [list() for i in range(rows // 2)]
|
| 56 |
+
k = 0
|
| 57 |
+
for i in range((row - 1) * rows // 2, row * rows // 2):
|
| 58 |
+
for j in range((column - 1) * columns // 2, column * columns // 2):
|
| 59 |
+
matrix_c_temp = matrix_a[i][j]
|
| 60 |
+
matrix_b[k].append(matrix_c_temp)
|
| 61 |
+
k += 1
|
| 62 |
+
return matrix_b
|
| 63 |
+
|
| 64 |
+
|
| 65 |
+
def matrix_merge(matrix_11, matrix_12, matrix_21, matrix_22):
|
| 66 |
+
'''
|
| 67 |
+
:param matrix_11:
|
| 68 |
+
:param matrix_12:
|
| 69 |
+
:param matrix_21:
|
| 70 |
+
:param matrix_22:
|
| 71 |
+
:return:mariix merged by 4 parts above
|
| 72 |
+
'''
|
| 73 |
+
length = len(matrix_11)
|
| 74 |
+
matrix_all = [list() for i in range(length * 2)] # build a matrix of double rows
|
| 75 |
+
for i in range(length):
|
| 76 |
+
# for each row. matrix_all list contain row of matrix_11 and matrix_12
|
| 77 |
+
matrix_all[i] = matrix_11[i] + matrix_12[i]
|
| 78 |
+
for j in range(length):
|
| 79 |
+
# for each row. matrix_all list contain row of matrix_21 and matrix_22
|
| 80 |
+
matrix_all[length + j] = matrix_21[j] + matrix_22[j]
|
| 81 |
+
return matrix_all
|
| 82 |
+
|
| 83 |
+
|
| 84 |
+
def strassen(matrix_a, matrix_b):
|
| 85 |
+
'''
|
| 86 |
+
:param matrix_a:
|
| 87 |
+
:param matrix_b:
|
| 88 |
+
:return:matrix_a * matrix_b
|
| 89 |
+
'''
|
| 90 |
+
row_a = len(matrix_a)
|
| 91 |
+
col_a = len(matrix_a[0])
|
| 92 |
+
row_b = len(matrix_b)
|
| 93 |
+
col_b = len(matrix_b[0])
|
| 94 |
+
if col_a != row_b:
|
| 95 |
+
print('matrix_a and matrix_b can not be multiplied')
|
| 96 |
+
return
|
| 97 |
+
global num_mul,num_addorsub
|
| 98 |
+
if row_a == 1 or col_a == 1 or row_b == 1 or col_b == 1:
|
| 99 |
+
matrix_all = [list() for i in range(row_a)]
|
| 100 |
+
for i in range(row_a):
|
| 101 |
+
for j in range(col_b):
|
| 102 |
+
matrix_all_temp = 0
|
| 103 |
+
for k in range(col_a):
|
| 104 |
+
matrix_all_temp += matrix_a[i][k] * matrix_b[k][j]
|
| 105 |
+
num_mul = num_mul + 1
|
| 106 |
+
num_addorsub = num_addorsub + 1
|
| 107 |
+
matrix_all[i].append(matrix_all_temp)
|
| 108 |
+
else:
|
| 109 |
+
# 10 first parts of computing
|
| 110 |
+
s1 = matrix_minus((matrix_divide(matrix_b, 1, 2)), (matrix_divide(matrix_b, 2, 2)))
|
| 111 |
+
s2 = matrix_add((matrix_divide(matrix_a, 1, 1)), (matrix_divide(matrix_a, 1, 2)))
|
| 112 |
+
s3 = matrix_add((matrix_divide(matrix_a, 2, 1)), (matrix_divide(matrix_a, 2, 2)))
|
| 113 |
+
s4 = matrix_minus((matrix_divide(matrix_b, 2, 1)), (matrix_divide(matrix_b, 1, 1)))
|
| 114 |
+
s5 = matrix_add((matrix_divide(matrix_a, 1, 1)), (matrix_divide(matrix_a, 2, 2)))
|
| 115 |
+
s6 = matrix_add((matrix_divide(matrix_b, 1, 1)), (matrix_divide(matrix_b, 2, 2)))
|
| 116 |
+
s7 = matrix_minus((matrix_divide(matrix_a, 1, 2)), (matrix_divide(matrix_a, 2, 2)))
|
| 117 |
+
s8 = matrix_add((matrix_divide(matrix_b, 2, 1)), (matrix_divide(matrix_b, 2, 2)))
|
| 118 |
+
s9 = matrix_minus((matrix_divide(matrix_a, 1, 1)), (matrix_divide(matrix_a, 2, 1)))
|
| 119 |
+
s10 = matrix_add((matrix_divide(matrix_b, 1, 1)), (matrix_divide(matrix_b, 1, 2)))
|
| 120 |
+
# 7 second parts of computing
|
| 121 |
+
p1 = strassen(matrix_divide(matrix_a, 1, 1), s1)
|
| 122 |
+
p2 = strassen(s2, matrix_divide(matrix_b, 2, 2))
|
| 123 |
+
p3 = strassen(s3, matrix_divide(matrix_b, 1, 1))
|
| 124 |
+
p4 = strassen(matrix_divide(matrix_a, 2, 2), s4)
|
| 125 |
+
p5 = strassen(s5, s6)
|
| 126 |
+
p6 = strassen(s7, s8)
|
| 127 |
+
p7 = strassen(s9, s10)
|
| 128 |
+
# 4 final parts of result
|
| 129 |
+
c11 = matrix_add(matrix_add(p5, p4), matrix_minus(p6, p2))
|
| 130 |
+
c12 = matrix_add(p1, p2)
|
| 131 |
+
c21 = matrix_add(p3, p4)
|
| 132 |
+
c22 = matrix_minus(matrix_add(p5, p1), matrix_add(p3, p7))
|
| 133 |
+
matrix_all = matrix_merge(c11, c12, c21, c22)
|
| 134 |
+
global num_assign
|
| 135 |
+
num_assign =num_assign+22
|
| 136 |
+
return matrix_all
|
| 137 |
+
|
| 138 |
+
|
| 139 |
+
def main():
|
| 140 |
+
|
| 141 |
+
# statistical data
|
| 142 |
+
A = np.random.random_integers(-5, 5, size=(256, 64))
|
| 143 |
+
print("\nRandom Matrix A:\n", A)
|
| 144 |
+
B = np.random.random_integers(-5, 5, size=(64, 128))
|
| 145 |
+
print("\nRandom Matrix B:\n", B)
|
| 146 |
+
|
| 147 |
+
C_verification=np.dot(A,B)
|
| 148 |
+
|
| 149 |
+
result = strassen(A, B)
|
| 150 |
+
print("\n A*B Result of matrixs by generate randomly\n",np.array(result))
|
| 151 |
+
|
| 152 |
+
print("\nfrequency of add/sub",num_addorsub)
|
| 153 |
+
print("frequency of assign", num_assign)
|
| 154 |
+
print("frequency of mul", num_mul)
|
| 155 |
+
|
| 156 |
+
if (C_verification==result).all():
|
| 157 |
+
print("\nCorrect")
|
| 158 |
+
else:
|
| 159 |
+
print("\nWrong")
|
| 160 |
+
|
| 161 |
+
if __name__ == '__main__':
|
| 162 |
+
main()
|
| 163 |
+
|
| 164 |
+
# frequency of add/sub 4499186
|
| 165 |
+
# frequency of assign 3989370
|
| 166 |
+
# frequency of mul 941192
|
| 167 |
+
# 2097152
|