Description of fast matrix multiplication algorithm: ⟨6×12×16:754⟩

Algorithm type

42 X^{4} Y^{4} Z^{4} + 4 X Y^{9} Z + 6 X^{6} Y^{2} Z^{2} + 26 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{4} Z^{4} + 12 X^{2} Y^{2} Z^{6} + 4 X Y^{6} Z^{2} + 80 X^{2} Y^{4} Z^{2} + 24 X^{2} Y^{2} Z^{4} + 24 X Y^{6} Z + 2 X^{3} Y^{3} Z + 16 X Y^{4} Z^{2} + 4 X Y^{3} Z^{3} + 8 X^{3} Y^{2} Z + 112 X^{2} Y^{2} Z^{2} + 32 X Y^{4} Z + 8 X Y^{3} Z^{2} + 16 X Y^{2} Z^{3} + 10 X^{3} Y Z + 34 X Y^{3} Z + 52 X Y^{2} Z^{2} + 20 X Y Z^{3} + 96 X Y^{2} Z + 40 X Y Z^{2} + 70 X Y Z

Algorithm definition

The algorithm ⟨6×12×16:754⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨3×3×4:29⟩.

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