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

Algorithm type

768 X^{4} Y^{6} Z^{6} + 32 X^{2} Y^{9} Z^{3} + 1152 X^{2} Y^{6} Z^{6} + 32 X^{4} Y^{6} Z^{3} + 48 X Y^{9} Z^{3} + 48 X^{6} Y^{3} Z^{3} + 400 X^{2} Y^{6} Z^{3} + 144 X^{2} Y^{3} Z^{6} + 288 X^{4} Y^{3} Z^{3} + 528 X Y^{6} Z^{3} + 216 X Y^{3} Z^{6} + 72 X^{3} Y^{3} Z^{3} + 880 X^{2} Y^{3} Z^{3} + 672 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨12×27×30:5280⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨4×9×5:132⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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