Survey on matrix multiplication algorithms

This paper focuses on the time analysis of different matrix multiplication algorithms. In the paper, the methods invented by Karatsuba and Strassen are analyzed and implemented; theoretical and real time is calculated. Afterwards the Karatsuba and the Strassen algorithms are merged, and combining these two algorithms a new approach is designed, which can be considered as a method for reducing the time complexity.