On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

This paper develops an algorithm to multiply a px2 matrix by a 2xn matrix in $\lceil (3pn+max(n,p))/2 \rceil$ multiplications for matrix multiplication without commutativity. The algorithm minimizes the number of multiplications for matrix multiplication without commutativity for the special cases p=1 or 2, n=1,2, $\cdots$ and p = 3, n = 3. It is shown that with commutativity fewer multiplications are required