Description of fast matrix multiplication algorithm: ⟨14×24×25:4800⟩

Algorithm type

8 X^{4} Y^{12} Z^{4} + 472 X^{4} Y^{8} Z^{4} + 24 X^{2} Y^{12} Z^{2} + 16 X^{4} Y^{8} Z^{2} + 8 X^{2} Y^{8} Z^{4} + 16 X Y^{12} Z + 600 X^{2} Y^{8} Z^{2} + 16 X^{2} Y^{8} Z + 8 X Y^{8} Z^{2} + 216 X^{4} Y^{4} Z^{2} + 160 X^{2} Y^{4} Z^{4} + 128 X Y^{8} Z + 176 X^{2} Y^{4} Z^{2} + 216 X^{2} Y^{4} Z + 16 X^{2} Y^{3} Z^{2} + 160 X Y^{4} Z^{2} + 944 X^{2} Y^{2} Z^{2} + 176 X Y^{4} Z + 32 X^{2} Y^{2} Z + 32 X Y^{3} Z + 16 X Y^{2} Z^{2} + 432 X^{2} Y Z + 256 X Y^{2} Z + 320 X Y Z^{2} + 352 X Y Z

Algorithm definition

The algorithm ⟨14×24×25:4800⟩ is the (Kronecker) tensor product of ⟨2×4×5:32⟩ with ⟨7×6×5:150⟩.

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