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.
-
Notifications
You must be signed in to change notification settings - Fork 0
magillj/Strassens
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Streamlined matrix multiplication using Strassen's algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published