Stability Improvements for Fast Matrix Multiplication

Abstract

We implement an Augmented Lagrangian method to minimize a constrained least-squares cost function designed to find polyadic decompositions of the matrix multiplication tensor. We use this method to obtain new discrete decompositions and parameter families of decompositions. Using these parametrizations, faster and more stable matrix multiplication algorithms can be discovered.