Description of fast matrix multiplication algorithm: ⟨6×8×9:296⟩

Algorithm type

12 X^{4} Y^{4} Z^{4} + 12 X^{2} Y^{6} Z^{2} + 24 X^{2} Y^{2} Z^{4} + 64 X^{2} Y^{2} Z^{2} + 24 X Y^{3} Z^{2} + 4 X Y^{2} Z^{3} + 8 X^{3} Y Z + 8 X^{2} Y^{2} Z + 32 X Y^{3} Z + 16 X^{2} Y Z + 20 X Y^{2} Z + 24 X Y Z^{2} + 48 X Y Z

Algorithm definition

The algorithm ⟨6×8×9:296⟩ is serendipitous tensor product (⟨2×3×4:20⟩ - 8) ⊗ ⟨3×3×2:15⟩ +4⟨3×3×4:29⟩.

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