For this operation to be well-defined, we require matrices,
*A* , *B* , and *C* to have dimensions
, , and ,
respectively.

If we partition

then

for . Thus, a matrix-matrix multiply can be written as a sequence of vector-matrix multiplies. Given the description for forming , it is not hard to derive a panel-matrix variant for this algorithm.