Sankar Basu
Journal of the Franklin Institute
Matrix-matrix multiplication is normally computed using one of the BLAS or a reinvention of part of the BLAS. Unfortunately, the BLAS were designed with small matrices in mind. When huge, well-conditioned matrices are multiplied together, the BLAS perform like the blahs, even on vector machines. For matrices where the coefficients are well conditioned. Winograd's variant of Strassen's algorithm offers some relief, but is rarely available in a quality form on most computers. We reconsider this method and offer a highly portable solution based on the Level 3 BLAS interface. © 1994 Academic Press, Inc.
Sankar Basu
Journal of the Franklin Institute
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
M. Tismenetsky
International Journal of Computer Mathematics
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.