The Strassen algorithm is developed for multiplying the matrices faster. It enables us to reduce O(n^3) time complexity to O(n^2.81).
However, this algorithm is applied for the matrices which are square and the dimension of the matrices must be a power of 2.
Assume that the matrices are called A and B.
Problem 1: A = 3x3 B = 3x3
Problem 2: A = 2x3 B = 3x1
How can we apply Strassen algorithm to multiplication of these matrices ? The only thing which comes to mind is enlarging the matrices to convert them into square non matrices by adding zeros, which is called padding operation. However, I am not sure whether this method is proper or not.
Is there another method ?
Is my notion correct ?