Description of fast matrix multiplication algorithm: ⟨9×9×24:1160⟩

Algorithm type

112 X^{4} Y^{6} Z^{6} + 32 X^{2} Y^{9} Z^{3} + 200 X^{2} Y^{6} Z^{6} + 32 X^{2} Y^{3} Z^{9} + 48 X Y^{9} Z^{3} + 48 X Y^{6} Z^{6} + 48 X Y^{3} Z^{9} + 16 X^{6} Y^{3} Z^{3} + 64 X^{2} Y^{6} Z^{3} + 64 X^{2} Y^{3} Z^{6} + 96 X Y^{6} Z^{3} + 96 X Y^{3} Z^{6} + 24 X^{3} Y^{3} Z^{3} + 112 X^{2} Y^{3} Z^{3} + 168 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨9×9×24:1160⟩ is the (Kronecker) tensor product of ⟨3×3×4:29⟩ with ⟨3×3×6:40⟩.

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