학술논문
Stability improvements for fast matrix multiplication
Document Type
Original Paper
Author
Source
Numerical Algorithms. :1-39
Subject
Language
English
ISSN
1017-1398
1572-9265
1572-9265
Abstract
We implement an Augmented Lagrangian method to minimize a constrained least-squares cost function designed to find sparse polyadic decompositions with elements of bounded maximal value of matrix multiplication tensors. We use this method to obtain new decompositions and parameter families of decompositions. Using these parametrizations, faster and more stable matrix multiplication algorithms are discovered.