Description of fast matrix multiplication algorithm: ⟨8×30×30:4200⟩

Algorithm type

30 X^{8} Y^{8} Z^{8} + 12 X^{4} Y^{12} Z^{4} + 90 X^{4} Y^{8} Z^{4} + 24 X^{2} Y^{12} Z^{2} + 288 X^{4} Y^{4} Z^{4} + 60 X^{2} Y^{8} Z^{2} + 96 X^{2} Y^{6} Z^{2} + 696 X^{2} Y^{4} Z^{2} + 144 X Y^{6} Z + 744 X^{2} Y^{2} Z^{2} + 360 X Y^{4} Z + 144 X Y^{3} Z + 936 X Y^{2} Z + 576 X Y Z

Algorithm definition

The algorithm ⟨8×30×30:4200⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨4×10×10:280⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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