DocumentCode
2175376
Title
Some theorems about matrix multiplication
Author
Hu, T.C. ; Shing, M.T.
fYear
1980
fDate
13-15 Oct. 1980
Firstpage
28
Lastpage
35
Abstract
This paper considers the computation of matrix chain products of the form M1 × M2 ×...× Mn-1. If the matrices are of different dimensions, the order in which the matrices are computed affects the number of operations. An optimum order is an order which minimizes the total number of operations. We present some theorems about an optimum order of computing the matrices. Based on these theorems, an O(n log n) algorithm for finding the optimum order is presented.
Keywords
Clocks; Costs; Dynamic programming; Graph theory; Heuristic algorithms; Joining processes; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1980., 21st Annual Symposium on
Conference_Location
Syracuse, NY, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1980.39
Filename
4567801
Link To Document