Exploiting the Structure in Tensor Decompositions for Matrix Multiplication
Abstract
We present a new algorithm for fast matrix multiplication using tensor decompositions which have special features. Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particular for $6\times 6$ matrix multiplication we reduce the exponent of the recent algorithm by Moosbauer and Poole from $2.8075$ to $2.8019$, while retaining a reasonable leading coefficient.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Tensor decomposition and applications
Matrix Theory and Algorithms
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 11 February 2026
- Language
- EN
- Document type
- Preprint