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

Algorithm type

56 X^{4} Y^{8} Z^{4} + 16 X^{2} Y^{12} Z^{2} + 16 X^{2} Y^{8} Z^{4} + 16 X Y^{12} Z + 8 X^{6} Y^{4} Z^{2} + 88 X^{2} Y^{8} Z^{2} + 16 X^{2} Y^{4} Z^{6} + 16 X Y^{8} Z^{2} + 32 X^{2} Y^{4} Z^{4} + 32 X Y^{8} Z + 8 X^{3} Y^{4} Z + 56 X^{2} Y^{4} Z^{2} + 16 X Y^{4} Z^{3} + 32 X Y^{4} Z^{2} + 112 X^{2} Y^{2} Z^{2} + 56 X Y^{4} Z + 16 X^{3} Y Z + 32 X Y^{3} Z + 32 X Y^{2} Z^{2} + 32 X Y Z^{3} + 64 X Y^{2} Z + 64 X Y Z^{2} + 112 X Y Z

Algorithm definition

The algorithm ⟨6×15×16:928⟩ is the (Kronecker) tensor product of ⟨2×5×4:32⟩ 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