Question
Write recurrence relations for matrixmultiplication using Strassen's method andsolve it using the Master method.
Answer :
Word Count : 664
_____ ____ ____ ______ __________ _____ __________ ________ _________ _________.
_________ ______ __________ ______ ________ ________ _________ ____ _____ _________ _____ ____.
_____ _________ _________ _____ _______ ________ _________.
___ ____ __________ ____ ______ __________ _____.
___ ___ ________ _________ ___ _____ ____ __________ _________ ____.
________ _____ _____ ____ _________ _____ _______.
________ _________ _____ _________ ___ __________ __________ _______ ______ ________ _____ ___.
______ _____ ______ _____ _________ _____ ____.
_____ _____ _________ _______ _________ ____ ________ ____.
_____ __________ ____ __________ _______ _________ ________ ____ ______ _________ ___ __________.
_________ ________ _____ ___ _________ ___ ________ ____ ___ ____.
_________ _______ _________ ________ ________ _________ _______ _____ __________ __________.
__________ _____ ___ __________ ____ ____ _______ _________ ______ ____ _________ _________.
_______ _______ _________ ___ _________.
__________ _____ _________ _________ ________ __________ _______.
___ __________ ___ ______ ___ ________ _______ _______ __________ _____.
______ ___ _________ ____ ________ ________ ________ _______.
_________ __________ __________ ______ _______ ______ ________ __________ _________ ________ ________.
___ _________ _______ _________ _________ ______ ______ ________ ________ ___.
_________ __________ ________ __________ ________ _______.
________ _______ _________ ________ _________ ________ _____ ___ _______.
________ __________ ______ _________ _____.
___ ___ _______ _______ ____ ________ _______ _______ ________ ___.
_____ __________ ______ ____ ___ __________ _______ _________ ________.
_________ ___ ______ _________ _________.
_________ _______ ____ _____ _________ _____.
_______ _____ _________ ________ _____ _______ ______ _________ __________ ______ ____.
_____ _______ ______ ________ __________ ______ ______ _______ ______ __________ ________ _____.
______ _______ __________ ___ ___ _______ ______ ____ ______ _________ _________.
____ ______ ___ __________ ________ __________ ____ _________ ________ _____.
_______ ______ _____ ________ ______ ________ _______ _______ ________.
______ ____ ___ __________ ___ _________ ________ ______.
___ ___ ____ _________ ______ ______ _____ ___ ____.
___ _______ ___ __________ __________ ______ ________ ____.
_______ _________ ____ _____ _____ _________ _________ _____.
_________ ____ ___ ______ _________ _________ ____ ______ ___.
_________ _________ __________ ___ ____ ________ ____ _______ _____.
____ _____ _____ ________ _________ ___ ___ ___ ___ _________ ______ _______.
__________ __________ ____ ___ _________ ________ ______ __________ ______ _____ ________ ____.
________ _____ __________ _____ _______ __________ ___ __________ ______ ________ __________.
___ ___ _____ _______ __________.
_______ ______ ________ __________ __________ _________ _______.
_______ ____ ______ ______ ______ _______.
___ _____ ________ ___ _____ _______ ___ ________ _______ ______.
_________ _____ ________ ______ ______ ____ ________ ______ _________.
___ __________ _____ _______ ___ _____ _______ ____ _____.
_________ ___ _______ _______ ________ ______ ____ ____ __________ _______.
______ ___ _______ ________ ________ ___ _______ _____ ____.
_______ ___ _________ ___ _____ ______.
____ _____ ______ _______ _______.
____ ______ ____ ______ __________.
________ _________ ___ ____ _____.
___ __________ ____ _________ ___ ________ ________ ________ ___ _____.
_________ ____ ______ ______ ______ __________ _______ _______ ________ ___ ____.
__________ ______ ___ ________ ________.
______ ______ ______ _______ _________ ___ ___ ____ _________ ___ ___.
____ ______ __________ ___ ___ __________ _____ _________ ___ ___ ____.
_________.
Skip in 10
Matrix multiplication is a fundamental operation in many algorithms, particularly in linear algebra and scientific computing. The conventional algorithm for multiplying two $n \times n$ matrices takes $O(n^3)$ time using a triple nested loop. However, Strassen's method significantly improves this by reducing the number of recursive multiplications required, at the cost of more additions and subtractions. Strassen's algorithm works by dividing each $n \times n$ matrix into four $n/2 \times n/2$ submatrices. Let $A$ and $B$ be the input matrices to be multiplied, and $C = A \times B$. We write: $$ A = \begin{bmatrix} A_{11} & A_{12} \\ A_{21} & A_{22} \end{bmatrix}, \quad B = \begin{bmatrix} B_{11} & B_{12} \\ B_{21} & B_{22} \end{bmatrix} $$ Let $C = A \times B$, then each quadrant of $C$ is computed as: $$ C_{11} = A_{11}B_{11} + A_{12}B_{21} \\ C_{12} = A_{11}B_{12} + A_{12}B_{22} \\ C_{21} = A_{21}B_{11} + A_{22}B_{21} \\ C_{22} = A_{21}B_{12} +
_____ _____ __________ ________ ______ ______ __________ __________ ________ ________ _____ ____._____ ____ ____ ______ __________ _____ __________ ________ _________ _________.
_________ ______ __________ ______ ________ ________ _________ ____ _____ _________ _____ ____.
_____ _________ _________ _____ _______ ________ _________.
___ ____ __________ ____ ______ __________ _____.
___ ___ ________ _________ ___ _____ ____ __________ _________ ____.
________ _____ _____ ____ _________ _____ _______.
________ _________ _____ _________ ___ __________ __________ _______ ______ ________ _____ ___.
______ _____ ______ _____ _________ _____ ____.
_____ _____ _________ _______ _________ ____ ________ ____.
_____ __________ ____ __________ _______ _________ ________ ____ ______ _________ ___ __________.
_________ ________ _____ ___ _________ ___ ________ ____ ___ ____.
_________ _______ _________ ________ ________ _________ _______ _____ __________ __________.
__________ _____ ___ __________ ____ ____ _______ _________ ______ ____ _________ _________.
_______ _______ _________ ___ _________.
__________ _____ _________ _________ ________ __________ _______.
___ __________ ___ ______ ___ ________ _______ _______ __________ _____.
______ ___ _________ ____ ________ ________ ________ _______.
_________ __________ __________ ______ _______ ______ ________ __________ _________ ________ ________.
___ _________ _______ _________ _________ ______ ______ ________ ________ ___.
_________ __________ ________ __________ ________ _______.
________ _______ _________ ________ _________ ________ _____ ___ _______.
________ __________ ______ _________ _____.
___ ___ _______ _______ ____ ________ _______ _______ ________ ___.
_____ __________ ______ ____ ___ __________ _______ _________ ________.
_________ ___ ______ _________ _________.
_________ _______ ____ _____ _________ _____.
_______ _____ _________ ________ _____ _______ ______ _________ __________ ______ ____.
_____ _______ ______ ________ __________ ______ ______ _______ ______ __________ ________ _____.
______ _______ __________ ___ ___ _______ ______ ____ ______ _________ _________.
____ ______ ___ __________ ________ __________ ____ _________ ________ _____.
_______ ______ _____ ________ ______ ________ _______ _______ ________.
______ ____ ___ __________ ___ _________ ________ ______.
___ ___ ____ _________ ______ ______ _____ ___ ____.
___ _______ ___ __________ __________ ______ ________ ____.
_______ _________ ____ _____ _____ _________ _________ _____.
_________ ____ ___ ______ _________ _________ ____ ______ ___.
_________ _________ __________ ___ ____ ________ ____ _______ _____.
____ _____ _____ ________ _________ ___ ___ ___ ___ _________ ______ _______.
__________ __________ ____ ___ _________ ________ ______ __________ ______ _____ ________ ____.
________ _____ __________ _____ _______ __________ ___ __________ ______ ________ __________.
___ ___ _____ _______ __________.
_______ ______ ________ __________ __________ _________ _______.
_______ ____ ______ ______ ______ _______.
___ _____ ________ ___ _____ _______ ___ ________ _______ ______.
_________ _____ ________ ______ ______ ____ ________ ______ _________.
___ __________ _____ _______ ___ _____ _______ ____ _____.
_________ ___ _______ _______ ________ ______ ____ ____ __________ _______.
______ ___ _______ ________ ________ ___ _______ _____ ____.
_______ ___ _________ ___ _____ ______.
____ _____ ______ _______ _______.
____ ______ ____ ______ __________.
________ _________ ___ ____ _____.
___ __________ ____ _________ ___ ________ ________ ________ ___ _____.
_________ ____ ______ ______ ______ __________ _______ _______ ________ ___ ____.
__________ ______ ___ ________ ________.
______ ______ ______ _______ _________ ___ ___ ____ _________ ___ ___.
____ ______ __________ ___ ___ __________ _____ _________ ___ ___ ____.
_________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.