From the graph below, it is possible to visualize the performance of the strassen algorithm compared to the usual implementation of matrix multiplication demonstrated by the red line.

Code Description The strassen_matrix_multiplication.c file contains the C code to multiply two matrices using Strassen's algorithm. It multiplies two 2x2 matrices as an example and displays the result ...

Communication avoiding parallel Strassen. In Section 2.2, we stated the communication cost of a new parallel algorithm for Strassen’s matrix multiplication, matching the asymptotic lower bound.

In this paper, we report on the development of an efficient GPU implementation of the Strassen-Winograd matrix multiplication algorithm for matrices of arbitrary sizes. We utilize multi-kernel ...

Moreover, the performance of Strassen's algorithm utilizing AVX-256 and AVX-512 are respectively 1.8 and 1. 7 times faster than the open source library, named Eigen. Our proposed implementation can be ...

The well known algorithm of Volker Strassen for matrix multiplication can only be used for $ (m2^k \times m2^k)$ matrices. For arbitrary $ (n \times n)$ matrices one has to add zero rows and columns ...

The ' Strassen's algorithm ' announced in 1969 is widely known as an algorithm for calculating the matrix product at high speed.