Description of fast matrix multiplication algorithm: ⟨16×24×27:5824⟩

Algorithm type

8 X^{9} Y^{8} Z^{6} + 56 X^{6} Y^{8} Z^{6} + 64 X^{6} Y^{4} Z^{4} + 56 X^{3} Y^{8} Z^{3} + 24 X^{6} Y^{4} Z^{3} + 8 X^{3} Y^{8} Z^{2} + 448 X^{4} Y^{4} Z^{4} + 56 X^{2} Y^{8} Z^{2} + 80 X^{3} Y^{4} Z^{3} + 56 X Y^{8} Z + 192 X^{4} Y^{2} Z^{2} + 448 X^{2} Y^{4} Z^{2} + 128 X^{3} Y^{2} Z^{2} + 24 X^{2} Y^{4} Z + 1536 X^{2} Y^{2} Z^{2} + 80 X Y^{4} Z + 384 X^{2} Y Z + 896 X Y^{2} Z + 1280 X Y Z

Algorithm definition

The algorithm ⟨16×24×27:5824⟩ is the (Kronecker) tensor product of ⟨4×4×9:104⟩ with ⟨4×6×3:56⟩.

Algorithm description

These encodings are given in compressed text format using the maple computer algebra system. In each cases, the last line could be understood as a description of the encoding with respect to classical matrix multiplication algorithm. As these outputs are structured, one can construct easily a parser to its favorite format using the maple documentation without this software.

Back to main table