Description of fast matrix multiplication algorithm: ⟨8×16×24:1898⟩

Algorithm type

12 X^{6} Y^{6} Z^{8} + 4 X^{3} Y^{9} Z^{4} + 6 X^{4} Y^{6} Z^{4} + 16 X^{3} Y^{6} Z^{4} + 2 X^{2} Y^{9} Z^{2} + 108 X^{4} Y^{4} Z^{4} + 6 X^{2} Y^{2} Z^{8} + 6 X Y^{9} Z + 20 X^{3} Y^{3} Z^{4} + 62 X^{2} Y^{6} Z^{2} + 162 X^{2} Y^{4} Z^{2} + 30 X Y^{6} Z + 2 X Y^{3} Z^{4} + 10 X^{2} Y^{3} Z^{2} + 8 X Y^{2} Z^{4} + 450 X^{2} Y^{2} Z^{2} + 24 X Y^{4} Z + 10 X Y Z^{4} + 120 X Y^{3} Z + 390 X Y^{2} Z + 450 X Y Z

Algorithm definition

The algorithm ⟨8×16×24:1898⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨4×4×6:73⟩.

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