Fast Matrix Multiplication without APA-Algorithms

摘要

The method of trilinear aggregating with implicit canceling for the design of fast matrix multiplication (MM) algorithms is revised and is formally presented with the use of Generating Tables and of linear transformations of the problem of MM. It is shown how to derive the exponent of MM below 2.67 even without the use of approximation algorithms. (Author)