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

Algorithm type

60 X^{4} Y^{4} Z^{4} + 4 X Y^{9} Z + 18 X^{6} Y^{2} Z^{2} + 12 X^{4} Y^{4} Z^{2} + 32 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{4} Z^{4} + 18 X^{2} Y^{2} Z^{6} + 4 X^{2} Y^{6} Z + 4 X Y^{6} Z^{2} + 6 X^{4} Y^{2} Z^{2} + 146 X^{2} Y^{4} Z^{2} + 6 X^{2} Y^{2} Z^{4} + 38 X Y^{6} Z + 6 X^{3} Y^{3} Z + 16 X^{2} Y^{4} Z + 16 X Y^{4} Z^{2} + 6 X Y^{3} Z^{3} + 24 X^{3} Y^{2} Z + 2 X^{2} Y^{3} Z + 118 X^{2} Y^{2} Z^{2} + 88 X Y^{4} Z + 2 X Y^{3} Z^{2} + 24 X Y^{2} Z^{3} + 30 X^{3} Y Z + 28 X^{2} Y^{2} Z + 26 X Y^{3} Z + 28 X Y^{2} Z^{2} + 30 X Y Z^{3} + 10 X^{2} Y Z + 134 X Y^{2} Z + 10 X Y Z^{2} + 30 X Y Z

Algorithm definition

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

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