Description of fast matrix multiplication algorithm: ⟨8×16×27:2080⟩

Algorithm type

16 X^{6} Y^{8} Z^{6} + 16 X^{3} Y^{12} Z^{3} + 16 X Y^{12} Z + 128 X^{4} Y^{4} Z^{4} + 16 X^{2} Y^{8} Z^{2} + 48 X^{3} Y^{4} Z^{3} + 128 X^{2} Y^{6} Z^{2} + 640 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 256 X Y^{3} Z + 768 X Y Z

Algorithm definition

The algorithm ⟨8×16×27:2080⟩ is the (Kronecker) tensor product of ⟨4×4×9:104⟩ with ⟨2×4×3:20⟩.

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