Description of fast matrix multiplication algorithm: ⟨8×16×30:2276⟩

Algorithm type

32 X^{4} Y^{8} Z^{4} + 180 X^{4} Y^{4} Z^{4} + 96 X^{2} Y^{8} Z^{2} + 180 X^{2} Y^{6} Z^{2} + 64 X Y^{8} Z + 248 X^{2} Y^{4} Z^{2} + 120 X^{2} Y^{2} Z^{4} + 120 X Y^{6} Z + 284 X^{2} Y^{2} Z^{2} + 128 X Y^{4} Z + 120 X Y^{3} Z^{2} + 40 X Y^{3} Z + 248 X Y^{2} Z + 120 X Y Z^{2} + 296 X Y Z

Algorithm definition

The algorithm ⟨8×16×30:2276⟩ is serendipitous tensor product (⟨2×4×3:20⟩ - 8) ⊗ ⟨4×4×10:115⟩ +4⟨4×8×10:224⟩.

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