Description of fast matrix multiplication algorithm: ⟨20×24×28:7200⟩

Algorithm type

16 X^{6} Y^{4} Z^{4} + 944 X^{4} Y^{4} Z^{4} + 32 X^{6} Y^{2} Z^{2} + 32 X^{4} Y^{4} Z^{2} + 16 X^{4} Y^{2} Z^{4} + 256 X^{4} Y^{2} Z^{2} + 432 X^{2} Y^{4} Z^{2} + 320 X^{2} Y^{2} Z^{4} + 32 X^{3} Y^{2} Z^{2} + 2240 X^{2} Y^{2} Z^{2} + 64 X^{3} Y Z + 64 X^{2} Y^{2} Z + 32 X^{2} Y Z^{2} + 512 X^{2} Y Z + 864 X Y^{2} Z + 640 X Y Z^{2} + 704 X Y Z

Algorithm definition

The algorithm ⟨20×24×28:7200⟩ is the (Kronecker) tensor product of ⟨4×4×4:48⟩ with ⟨5×6×7:150⟩.

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