Skip to content

Implementations of some of the Matrix Multiplication Algorithms

Notifications You must be signed in to change notification settings

AshiqAR/Matrix-Multiplication-Algorithms

Repository files navigation

Matrix-Multiplication-Algorithms

  1. Iterative Matrix Multiplication Implementation ( Time Complexity : O(n3) )
  2. Divide and Conquer Matrix Multiplication ( Time Complexity : O(n3) )
  3. Strassen's Divide and Conquer Matrix Multiplication ( Time Complexity : O(n2.807) )

Test File

  • The test file contains all the algorithm implementations in one file
  • Compare the perfomance of each algorithms for a range of values of n
  • The average Runtime and standard deviation of the runtimes for each value of n for each algorithm can be obtained

Releases

No releases published

Packages

No packages published

Languages