|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/5902
| Title: | On Minimizing the Number of Multiplications Necessary for Matrix Multiplication |
| Authors: | Hopcroft, John E.
Kerr, Leslie Robert |
| Keywords: | computer science
technical report |
| Issue Date: | Sep-1969 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR69-44 |
| Abstract: | This paper develops an algorithm to multiply a px2 matrix by a 2xn matrix in $\lceil (3pn+max(n,p))/2 \rceil$ multiplications for matrix multiplication without commutativity. The algorithm minimizes the number of multiplications for matrix multiplication without commutativity for the special cases p=1 or 2, n=1,2, $\cdots$ and p = 3, n = 3. It is shown that with commutativity fewer multiplications are required. |
| URI: | http://hdl.handle.net/1813/5902 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
