Description of fast matrix multiplication algorithm: ⟨6×15×24:1280⟩

Algorithm type

128 X^{4} Y^{12} Z^{6} + 192 X^{2} Y^{12} Z^{6} + 128 X^{2} Y^{12} Z^{3} + 192 X Y^{12} Z^{3} + 256 X^{2} Y^{3} Z^{3} + 384 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨6×15×24:1280⟩ is the (Kronecker) tensor product of ⟨2×5×4:32⟩ with ⟨3×3×6:40⟩.

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