Bissoy.com
Doctors Medicines MCQs Q&A

Compute the product matrix using Strassen’s matrix multiplication algorithm. Given a11=1; a12=3;a21=5;a22=7 b11=8;b12=4;b21=6;b22=2

Compute the product matrix using Strassen’s matrix multiplication algorithm. Given a11=1; a12=3;a21=5;a22=7 b11=8;b12=4;b21=6;b22=2 Correct Answer c11=26;c12=10;c21=82;c22=34

The solution can be obtained by C11=1*8 + 3*6 =8+18=26 C12=1*4 + 3*2 =4+6=10 C21=5*8 + 7*6 =40+42=82 C22= 5*4 + 7*2=20+14=34.

Related Questions

Assume that multiplying a matrix G1 of dimension ? × ? with another matrix G2 of dimension ? × ? requires ??? scalar multiplications. Computing the product of n matrices G1G2G3…Gn can be done by parenthesizing in different ways. Define Gi Gi+1 as an explicitly computed pair for a given paranthesization if they are directly multiplied. For example, in the matrix multiplication chain G1G2G3G4G5G6 using parenthesization (G1(G2G3))(G4(G5G6)), G2G3 and G5G6 are the only explicitly computed pairs.Consider a matrix multiplication chain F1F2F3F4F5, where matrices F1, F2, F3, F4 and F5 are of dimensions 2 × 25, 25 × 3, 3 × 16, 16 × 1 and 1 × 1000, respectively. In the parenthesization of F1F2F3F4F5 that minimizes the total number of scalar multiplications, the explicitly computed pairs is/are
Consider the following pattern of numbers: \(\dfrac{\begin{matrix} 8 \\\ 6 \ \\\ 4 \ \end{matrix}}{ \ 6} \ \ \dfrac{\begin{matrix} 10 \\\ 5 \ \\\ 6 \ \end{matrix}}{ \ 11} \ \ \dfrac{\begin{matrix} 15 \\\ 7 \ \\\ 8 \ \end{matrix}}{ \ 16} \ \ \dfrac{\begin{matrix} 13 \\\ 4 \ \\\ 8 \ \end{matrix}}{ \ ?}\) What is the number at ? in the above pattern?
What is the running time of Strassen’s algorithm for matrix multiplication?
Strassen’s matrix multiplication algorithm follows ___________ technique.
The number of scalar additions and subtractions used in Strassen’s matrix multiplication algorithm is ________
Which of the following is/are the property (ies) of multiplication in integers? I. Multiplication is associative II. Multiplication is closed III. Multiplication distributes over addition
How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
Two stores A and B bought the same product from the company at the same price. Store A marked the price of the product 50% above its cost price and offered two successive discounts of 15% and 10% on the marked price of the product, while store B marked the price of the product 60% above its cost price and offered two successive discounts of 15% and 12% on the marked price of the product. If a customer buys the product from store B, he has to pay Rs. 986 more than that at store A. At what price the two stores bought the product from the company?
Which of the following statement (s) is/are true about the following eliminations? (1) Hoffmann product is major product in I (2) Saytzeff product is major product in I (3) Hoffmann product is major product in II (4) Saytzeffproduct is major product in II
Strassen’s algorithm is a/an_____________ algorithm.