Accession Number : ADA113419

Title :   Fast Matrix Multiplication without APA-Algorithms,

Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Pan,V

PDF Url : ADA113419

Report Date : Oct 1981

Pagination or Media Count : 31

Abstract : 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)

Descriptors :   *Matrix theory, *Multiplication, Matrices(mathematics), Algorithms, Linear systems, Transformations(mathematics), Tensors

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE