Description of fast matrix multiplication algorithm: ⟨16×24×27:5616⟩

Algorithm type

72 X^{6} Y^{8} Z^{6} + 72 X^{3} Y^{8} Z^{3} + 72 X^{6} Y^{4} Z^{3} + 576 X^{4} Y^{4} Z^{4} + 72 X^{2} Y^{8} Z^{2} + 72 X Y^{8} Z + 576 X^{4} Y^{2} Z^{2} + 576 X^{2} Y^{4} Z^{2} + 72 X^{2} Y^{4} Z + 1152 X^{2} Y^{2} Z^{2} + 1152 X^{2} Y Z + 1152 X Y^{2} Z

Algorithm definition

The algorithm ⟨16×24×27:5616⟩ is the (Kronecker) tensor product of ⟨4×4×9:104⟩ with ⟨4×6×3:54⟩.

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