Description of fast matrix multiplication algorithm: ⟨16×24×30:6165⟩

Algorithm type

855 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{4} Z^{4} + 810 X^{4} Y^{2} Z^{2} + 1350 X^{2} Y^{4} Z^{2} + 450 X^{2} Y^{2} Z^{4} + 72 X Y^{4} Z^{2} + 144 X^{2} Y^{2} Z^{2} + 540 X Y^{4} Z + 360 X^{2} Y^{2} Z + 360 X^{2} Y Z^{2} + 612 X Y^{2} Z^{2} + 288 X Y^{2} Z + 180 X Y Z^{2} + 108 X Y Z

Algorithm definition

The algorithm ⟨16×24×30:6165⟩ is serendipitous tensor product (⟨4×4×10:115⟩ - 30) ⊗ ⟨4×6×3:54⟩ +15⟨4×6×6:105⟩.

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