Further schemes for combining matrix algorithms

  • Patrick C. Fischer
Thursday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Optimal use of either Strassen's or Winograd's algorithms for multiplying 2×2 matrices within the framework of Fischer and Probert yields only a relatively small reduction in Strassen's constant of 4.7. Two additional schemes are discussed: minimal introduction of zero rows and columns, and permitting block multiplication as an additional tool. The first scheme yields extremely small improvement, but the second turns out to be highly effective.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Fischer, P.C., Probert, R.L., Efficient Procedures for Using Matrix Algorithms, these Proceedings (1974).Google Scholar
  2. [2]
    Strassen, V., Gaussian Elimination is not Optimal, Numer. Math. 13 (1969), 354–356.Google Scholar
  3. [3]
    Winograd, S., Private communication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Patrick C. Fischer
    • 1
  1. 1.University of WaterlooCanada

Personalised recommendations