Description of fast matrix multiplication algorithm: ⟨12×12×30:2480⟩

Algorithm type

16 X^{8} Y^{12} Z^{12} + 24 X^{4} Y^{12} Z^{12} + 16 X^{4} Y^{9} Z^{6} + 24 X^{2} Y^{9} Z^{6} + 224 X^{4} Y^{6} Z^{6} + 32 X^{2} Y^{9} Z^{3} + 336 X^{2} Y^{6} Z^{6} + 16 X^{2} Y^{3} Z^{9} + 16 X^{4} Y^{6} Z^{3} + 32 X^{4} Y^{3} Z^{6} + 48 X Y^{9} Z^{3} + 24 X Y^{3} Z^{9} + 152 X^{2} Y^{6} Z^{3} + 80 X^{2} Y^{3} Z^{6} + 48 X^{4} Y^{3} Z^{3} + 192 X Y^{6} Z^{3} + 48 X Y^{3} Z^{6} + 504 X^{2} Y^{3} Z^{3} + 648 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨12×12×30:2480⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨4×4×5:62⟩.

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