Also called CuboidMM, this method forms matrix multiplication in a 3D hexahedron and then partitions and processes to multiple pieces called cuboid.

The algorithm minimizes the number of multiplications for matrix multiplication without commutativity for the special cases p = 1 or 2, n = 1, 2, ⋯ and p = 3, n = 3. It is shown that commutativity ...