Description of fast matrix multiplication algorithm: ⟨8×9×20:940⟩

Algorithm type

52 X^{4} Y^{4} Z^{4} + 16 X Y^{9} Z + 12 X^{6} Y^{2} Z^{2} + 4 X^{4} Y^{2} Z^{4} + 68 X^{2} Y^{6} Z^{2} + 8 X^{2} Y^{4} Z^{4} + 8 X^{2} Y^{2} Z^{6} + 8 X Y^{6} Z^{2} + 12 X^{4} Y^{2} Z^{2} + 24 X^{2} Y^{4} Z^{2} + 32 X^{2} Y^{2} Z^{4} + 24 X Y^{6} Z + 12 X^{3} Y^{3} Z + 4 X^{2} Y^{3} Z^{2} + 8 X Y^{3} Z^{3} + 12 X^{2} Y^{3} Z + 176 X^{2} Y^{2} Z^{2} + 32 X Y^{3} Z^{2} + 36 X^{3} Y Z + 12 X^{2} Y Z^{2} + 68 X Y^{3} Z + 24 X Y^{2} Z^{2} + 24 X Y Z^{3} + 36 X^{2} Y Z + 72 X Y^{2} Z + 96 X Y Z^{2} + 60 X Y Z

Algorithm definition

The algorithm ⟨8×9×20:940⟩ is the (Kronecker) tensor product of ⟨2×3×4:20⟩ with ⟨4×3×5:47⟩.

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