Affiliation:
1. École Polytechnique, Palaiseau, France
2. The University of Western Ontario, Canada
Abstract
We tabulate improved costs for the multiplication of matrices of small size, up to 30. Following previous work by Probert &Fisc her [5], Smith [4], and Mezzarobba [2], we base our approach on previous algorithms for small matrices due to Strassen, Winograd, Pan, Laderman, . . . and show how to exploit these standard algorithms in an improved way. We illustrate the use of our results by generating multiplication code for various rings, such as integers, polynomials, differential operators or linear recurrence operators.
Publisher
Association for Computing Machinery (ACM)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献