Exploiting the Structure in Tensor Decompositions for Matrix Multiplication
Symbolic Computation
2026-05-22 v3
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 matrix multiplication we reduce the exponent of the recent algorithm by Moosbauer and Poole from to , while retaining a reasonable leading coefficient.
Cite
@article{arxiv.2602.11041,
title = {Exploiting the Structure in Tensor Decompositions for Matrix Multiplication},
author = {Manuel Kauers and Jakob Moosbauer and Isaac Wood},
journal= {arXiv preprint arXiv:2602.11041},
year = {2026}
}