Description of fast matrix multiplication algorithm: ⟨15×20×24:4044⟩

Algorithm type

384 X^{4} Y^{4} Z^{4} + 384 X^{6} Y^{2} Z^{2} + 144 X^{2} Y^{4} Z^{2} + 144 X^{2} Y^{2} Z^{4} + 144 X^{3} Y^{2} Z + 180 X^{3} Y Z^{2} + 1332 X^{2} Y^{2} Z^{2} + 18 X^{3} Y Z + 36 X^{2} Y^{2} Z + 18 X^{2} Y Z^{2} + 36 X Y^{3} Z + 36 X Y^{2} Z^{2} + 54 X Y Z^{3} + 648 X Y^{2} Z + 486 X Y Z^{2}

Algorithm definition

The algorithm ⟨15×20×24:4044⟩ is serendipitous tensor product (⟨5×5×12:204⟩ - 36) ⊗ ⟨3×4×2:20⟩ +18⟨3×4×4:38⟩.

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