Exploiting fast matrix multiplication within the level 3 BLAS
ACM Transactions on Mathematical Software (TOMS)
Algebras Having Linear Multiplicative Complexities
Journal of the ACM (JACM)
Implementation of Strassen's algorithm for matrix multiplication
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Computational complexity and numerical stability
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An efficient algorithm for computing powers of triangular matrices
ACM '78 Proceedings of the 1978 annual conference - Volume 2
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Theoretical Computer Science - Algebraic and numerical algorithm
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Adaptive Strassen's matrix multiplication
Proceedings of the 21st annual international conference on Supercomputing
Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
IEEE Transactions on Computers
Adaptive Winograd's matrix multiplications
ACM Transactions on Mathematical Software (TOMS)
Using recursion to boost ATLAS's performance
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
| Hi-index | 0.00 |
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.