On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
This paper develops an algorithm to multiply a $p \times 2$ matrix by a $2 \times n$ matrix in $\lceil (3pn + \max (n,p)) 2\rceil $ multiplications without use of commutativity of matrix elements. The algorithm minimizes the number of multiplications for matrix multiplication without commutativity for the special cases …