Description of fast matrix multiplication algorithm: ⟨3×3×6:40⟩

Algorithm type

16 X^{2} Y^{3} Z^{3} + 24 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨3×3×6:40⟩ is taken from:

Alexey Vladimirovich Smirnov. The bilinear complexity and practical algorithms for matrix multiplication. Computational Mathematics and Mathematical Physics, 53(2):1781--1795, December 2013. [DOI]

Algorithm description

maple tensor 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