This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Problem 3: Matrix Multiplication The product of two n x n matrices X and Y is a third n x n matrix Z with (i,j) th entry of Z given as This can be graphically depicted as multiplying a row of X with a column of Y as follows: 1. Devise a divide-and-conquer algorithm for solving this problem. Explain your solution clearly in words. 2. Write the pseudo-code for the solution you have proposed. 3. Derive the time complexity of your solution. Show each step clearly. Note that the simple method described above takes O(n 3 ). [Hint: Consider n/2 x n/2 sub-matrices of matrices X and Y. There are four such sub-matrices in each X and Y. Relate them to the corresponding sub-matrices of Z]...
View Full Document