For this operation to be well-defined, we require
matrices A , B , and C to have dimension 
,
, and 
, respectively.
If we partition
then
Thus, this matrix-matrix multiply can again be written as
a sequence of rank-one updates.
Given the description for forming
, it is not
hard to derive a
panel-panel variant for this algorithm.