BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-70-157
       ENTRY:: November 06, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Algorithms for matrix multiplication
        TYPE:: Technical Report
      AUTHOR:: Brent, Richard P.
        DATE:: March 1970
       PAGES:: 55
    ABSTRACT:: Strassen's and Winograd's algorithms for matrix
               multiplication are investigated and compared with the normal
               algorithm. Floating-point error bounds are obtained, and it
               is shown that scaling is essential for numerical accuracy
               using Winograd's method. In practical cases Winograd's method
               appears to be slightly faster than the other two methods, but
               the gain is, at most, about 20%. Finally, an attempt to
               generalize Strassen's method is described.
       NOTES:: [Adminitrivia V1/Prg/19951106]
         END:: STAN//CS-TR-70-157