Description of fast matrix multiplication algorithm: ⟨8×9×21:945⟩

Algorithm type

18 X^{4} Y^{4} Z^{6} + 45 X^{4} Y^{4} Z^{4} + 6 X^{2} Y^{2} Z^{8} + 18 X^{4} Y^{4} Z^{2} + 36 X^{2} Y^{2} Z^{6} + 36 X^{2} Y^{4} Z^{3} + 90 X^{2} Y^{4} Z^{2} + 36 X^{2} Y^{2} Z^{4} + 36 X^{2} Y^{4} Z + 36 X^{2} Y^{2} Z^{3} + 12 X Y^{2} Z^{4} + 120 X^{2} Y^{2} Z^{2} + 72 X Y^{2} Z^{3} + 12 X Y Z^{4} + 36 X^{2} Y^{2} Z + 72 X Y^{2} Z^{2} + 72 X Y Z^{3} + 60 X Y^{2} Z + 72 X Y Z^{2} + 60 X Y Z

Algorithm definition

The algorithm ⟨8×9×21:945⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨4×3×7:63⟩.

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