About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
FOCS 1979
Conference paper
Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplications
Abstract
The acceleration of matrix multiplication MM, is based on the combination of the method of algebraic field extension due to D. Bini, M. Capovani, G. Lotti, F. Romani and S. Winograd and of trilinear aggregating, uniting and canceling due to the author. A fast algorithm of O(N2.7378) complexity for N × N matrix multiplication is derived. With A. Schönhage's Theorem about partial and total MM, our approach gives the exponent 2.6054 by the price of a serious increase of the constant.