Description of fast matrix multiplication algorithm: ⟨4×24×24:1456⟩

Algorithm type

2 X Y^{15} Z + 18 X^{4} Y^{8} Z^{4} + 6 X^{2} Y^{12} Z^{2} + 2 X^{2} Y^{12} Z + 6 X^{4} Y^{8} Z^{2} + 6 X^{2} Y^{10} Z^{2} + 16 X Y^{12} Z + 78 X^{4} Y^{4} Z^{4} + 72 X^{2} Y^{8} Z^{2} + 8 X Y^{10} Z + 8 X^{2} Y^{8} Z + 18 X Y^{9} Z + 80 X^{2} Y^{6} Z^{2} + 64 X Y^{8} Z + 158 X^{2} Y^{4} Z^{2} + 80 X Y^{6} Z + 10 X^{2} Y^{4} Z + 10 X Y^{5} Z + 232 X^{2} Y^{2} Z^{2} + 112 X Y^{4} Z + 124 X Y^{3} Z + 176 X Y^{2} Z + 170 X Y Z

Algorithm definition

The algorithm ⟨4×24×24:1456⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨2×6×6: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