Report Number: CS-TR-70-157
Institution: Stanford University, Department of Computer Science
Title: Algorithms for matrix multiplication
Author: Brent, Richard P.
Date: March 1970
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.