Description of fast matrix multiplication algorithm: ⟨9×12×16:1080⟩

Algorithm type

72 X^{4} Y^{4} Z^{4} + 72 X^{2} Y^{2} Z^{6} + 72 X^{4} Y^{2} Z^{2} + 72 X^{2} Y^{4} Z^{2} + 216 X^{2} Y^{2} Z^{2} + 72 X^{2} Y Z^{3} + 72 X Y^{2} Z^{3} + 216 X^{2} Y Z + 216 X Y^{2} Z

Algorithm definition

The algorithm ⟨9×12×16:1080⟩ is the (Kronecker) tensor product of ⟨3×2×4:20⟩ with ⟨3×6×4: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