In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in ...

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 ...

THEOREM 1. 10 Consider Strassen’s algorithm implemented on a sequential machine with fast memory of size M. Then for M n 2, the communication cost of Strassen’s algorithm is. It holds for any ...

Prior implementations of Strassen's matrix multiplication algorithm on GPUs traded additional workspace in the form of global memory or registers for time. Although Strassen's algorithm offers a ...

In fact, fast matrix multiplication algorithms with smaller exponent than Strassen’s in their computational complexity require even less communication. I’ll talk about recent development in ...

Abstract: 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 ...