Skip to content

Latest commit

 

History

11 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 

Repository files navigation

Strassen's Algorithm

Efficiently multiplies two input matrices by using an implementation of Strassen's algorithm in C. Switches to use the ordinary matrix multiplication when matrices hit a certain threshold of size (around 2^6). On small matrices the ordinary matrix multiplication algorithm is found to be more efficient because of lower overhead.

About

Streamlined matrix multiplication using Strassen's algorithm

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages