Strassen Matrix Multiplication and Graph Search Algorithm

STATISTICS
Student Name ****
Student Id *****
Submission Date ***

Table of Contents
Question 9.............................................................................................................................................1
Question 2.............................................................................................................................................4

Question 9
a)
A = A1.1 A1.2
A2.1 A2.2
B = B1.1 B1.2
B2.1 B2.2
And C =C1.1 C1.2
C2.1 C2.2
c11 = A11*B11+A12*B21
c12 = A11*B11+A12*B22
c21 = A21*B11+A22*B21
c22 = A21*B12+A22*B22
2k * 2k is considering the value of k=1 and the Strassen matrix is,
T (n) = { 2k k =0
2k∗2k k=1 , k > 0
T (k) = 2k k
2 + K2 = 0(K3)
k is the odd value of Strassen matrix.
= 2+ 2k k
2 + K2
= 0(k 2.81)
The multiplication of Strassen method in 2x2 matrixes is,
X1 = (A11*B22) + (A11*B22)
X2 = (A21*A22) * B11
X3 = A11* (B12- B22)
X4 = A22* (B21- B11)
X5 = 1
X6 = 1
X7 = 1
C21 = X2 + X4
C2,1 = [(A2,1*A2,2) * B1,1] + [A2,2* (B2,1- B1,1)]
C2,1 = (A2,1 B1,1) + (A2,2 B2,1)
1