Fast Matrix Multiplication without APA-Algorithms,

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1981
Accession Number
ADA113419

Entities

People

  • V. Pan

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Coefficients
  • Complex Numbers
  • Computer Science
  • Computers
  • Construction
  • Equations
  • Identities
  • Notation
  • Numbers
  • Observation
  • Rational Functions
  • Sequences
  • Test And Evaluation

Fields of Study

  • Computer science

Readers

  • Approximation Theory.
  • Calculus or Mathematical Analysis
  • Optical Fiber Sensing and Electromagnetic Propagation.