Question: This problem compares the real run time of the simple (n 3 ) time algorithm and Strassens (n 2.81) time algorithm for solving the Matrix
This problem compares the real run time of the simple (n 3 ) time algorithm and Strassens (n 2.81) time algorithm for solving the Matrix Multiplication problem. For simplicity, we assume n = 2j is a power of 2; and we only calculate the time needed for additions/subtractions and multiplications on matrix elements. Let T1(n) be the real run time of the simple algorithm. Let T2(n) be the real run time of Strassens algorithm. Assume that the addition/subtraction of two numbers takes 0.25 unit time, and the multiplication of two numbers takes 1 unit time (a reasonable assumption for real machines). For the base case n = 1, both algorithms perform one multiplication and no addition, thus take 1 unit time. The simple algorithm makes 8 recursive calls to multiply two n/2 n/2 matrices, plus 4 additions of two n/2 n/2 matrices. Thus T1(n) satisfies:
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
