Description of fast matrix multiplication algorithm: ⟨4×20×24:1248⟩

Algorithm type

2 X Y^{15} Z + 6 X^{4} Y^{8} Z^{4} + 2 X^{2} Y^{12} Z^{2} + 30 X^{4} Y^{6} Z^{4} + 6 X^{2} Y^{10} Z^{2} + 12 X Y^{12} Z + 10 X^{2} Y^{9} Z^{2} + 36 X^{4} Y^{4} Z^{4} + 44 X^{2} Y^{8} Z^{2} + 8 X Y^{10} Z + 16 X Y^{9} Z + 100 X^{2} Y^{6} Z^{2} + 48 X Y^{8} Z + 106 X^{2} Y^{4} Z^{2} + 80 X Y^{6} Z + 50 X^{2} Y^{3} Z^{2} + 10 X Y^{5} Z + 138 X^{2} Y^{2} Z^{2} + 124 X Y^{4} Z + 106 X Y^{3} Z + 184 X Y^{2} Z + 130 X Y Z

Algorithm definition

The algorithm ⟨4×20×24:1248⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨2×5×6:48⟩.

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