Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Kauers, Manuel, Moosbauer, Jakob, Wood, Isaac
Institution: Johannes Kepler University of Linz
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Austrian Science Fund
OpenAlex ID: W7128739328
Cites:
Cited by:
Related to: