Publication

Abstract : Ever since the dawn of the computer age, researchers have been trying to find an optimal way of multiplying matrices, afundamental operation that is a bottleneck for many important algorithms Faster matrix multiplication would give more efficient algorithms for many standard linear algebra problems, such as inverting matrices, solving of MM because Strassen's reduces the total number of operations. The Strassen’s method of matrix multiplication is a typical divide and conquer algorithm. Strassen achieved this operation reduction by replacing computationally expensive systems of linear equations, and finding determinants. Even some basic graph algorithms run only as fast as matrix multiplication. Strassen's matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations MMs with matrix additions (MAs). Strassen’s method is not the asymptotically faster known matrix multiplication algorithm, but it is most widely used for large matrices. In this paper we describe a new variant of Strassen’s where in additive complexity is reduced to 15 operations as compared to 18.