Reviewing Matrix Muliplication


  • Neelam Amien District Mandi Bahauddin, 50400, Pakistan
  • Abida Naseem Mitha Tiwana, District Khushab, 41250, Pakistan


Algorithm written using different methods can still give same result. One of the ways to determine whether a solution is optimal or not is to determine how much time does it take to solve the specific problem. The problem that is targeted in this paper is Matrix multiplication that is widely used in many scientific computations. Different solutions of this problem are evaluated in this paper and all of them are compared on the basis of their time complexity. After comparing five most known algorithms for matrix multiplication we concluded that coppersmith-winograd algorithm is fastest in terms of time.