Fast Matrix Multiplication without APA-Algorithms,

reportActive / Technical Report | Accession Number: ADA113419 | Open PDF

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

Author(s):
Pan, V.
Author Organization(s):
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Supplementary Note:
Prepared in cooperation with State Univ. of New York, Albany, Grant NSF-MCS-80-03347.
Pagination:
0031

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
STAN-CS-81-882
Contract/Grant Number(s):
N00014-81-K-0269, NSF-MCS-77-23738
 Subject Terms
Joint Capability Areas:
JCA_5_Command and Control; JCA_5.3_Planning; JCA_1.2_Force Preparation; JCA_1_Force Support
Communities of Interest:
Materials and Manufacturing Processes
Descriptor(s):
*Matrix theory, *Multiplication, Matrices(mathematics), Algorithms, Linear systems, Transformations(mathematics), Tensors
Field(s)/Group(s):
Theoretical Mathematics
Keyword(s):
Fast matrix multiplication
Report Date:
1981 Oct 01