ALGORITHMS FOR MATRIX MULTIPLICATION
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
Strassens and Winograds 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 Winograds method. In practical cases Winograds method appears to be slightly faster than the other two methods, but the gain is, at most, about 20. An attempt to generalize Strassens method is described.
- Statistics and Probability
- Computer Programming and Software