This project implements matrix multiplication optimization using Strassen's algorithm, a divide-and-conquer approach that reduces the complexity of matrix multiplication from (O(n^3)) to approximately ...

This repo contains a Rust program with Strassen’s algorithm, recursive matrix multiplication, and iterative matrix multiplication. There are also some experiments investigating the optimal base case ...

Abstract: Strassen’s algorithm to multiply two n × n matrices reduces the asymptotic operation count from O(n3) of the traditional algorithm to O(n2.38), thus on distributed memory computers, the ...

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