There has been much effort to improve the runtime of matrix multiplication. The trivial algorithm multiplies n×n matrices in O(n) time. Strassen (’69) surprised everyone by giving an O(n) time algorithm. This began a long line of improvements until in 1986, Coppersmith and Winograd achieved O(n). After 24 years of no progress, in 2010 Andrew Stothers, a graduate student in Edinburgh, improved t...

Matrix multiplication is widely used in a variety of applications and is often one of the core components of many scientific computations which includes graph theory, numerical methods, digital control and signal processing. Multiplication of large matrices require a lot of computation time as its complexity is O(n), where n is the dimension of the matrix. A serial algorithm to compute large ma...