Question

Which describes the best usage of Strassen's matrix multiplication algorithms relative to the traditional algorithm (e.g. taught in Linear Algebra) where the matrices to be multiplied are n x n? explain

A

Use the traditional algorithm for all sizes of n

B

Use Strassen's algorithm for all sizes of n

C

Use Strassen's algorithm for small n and the traditional algorithm for large n

D

Use Strassen's algorithm for large n and the traditional algorithm for small n

E

Use Strassen's algorithm for large n but when the sub-problems get small switch to the traditional algorithm

Answer 1

Solution:

Strassen's algorithm:

This is named after volker strassen who found it.

This algorithm is faster than the traditional and standard matrix multiplication algorithm.

It can be used for calculations in large matrices.

The performance of strassen algorithm is faster when compared to traditional algorithm when matrix is large.

The strassen algorithm is slower for smaller matrices.

Answer:

The option is D.

The performance can be good when we use strassen algorithm for large n and traditional algorithm for small n.