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

Strassen's algorithm is a divide and conquer algorithm for multiplying two square matrices of dimension n by n where n is a power of 2. The runtime is O(n^log_2(7)) which beats the naive O(n^3) ...

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: Strassen's algorithm has fascinated as a popular recursive algorithm for square matrix multiplication with the complexity of O(n 2.807) in many scientific applications since 1969. However, ...