Description of fast matrix multiplication algorithm: ⟨8×20×27:2600⟩

Algorithm type

20 X^{6} Y^{8} Z^{6} + 8 X^{3} Y^{12} Z^{3} + 24 X^{3} Y^{8} Z^{3} + 8 X Y^{12} Z + 160 X^{4} Y^{4} Z^{4} + 20 X^{2} Y^{8} Z^{2} + 48 X^{3} Y^{4} Z^{3} + 64 X^{2} Y^{6} Z^{2} + 24 X Y^{8} Z + 192 X^{2} Y^{4} Z^{2} + 704 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 128 X Y^{3} Z + 384 X Y^{2} Z + 768 X Y Z

Algorithm definition

The algorithm ⟨8×20×27:2600⟩ is the (Kronecker) tensor product of ⟨4×4×9:104⟩ with ⟨2×5×3:25⟩.

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