Title :
Some theorems about matrix multiplication
Author :
Hu, T.C. ; Shing, M.T.
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;
Conference_Titel :
Foundations of Computer Science, 1980., 21st Annual Symposium on
Conference_Location :
Syracuse, NY, USA
DOI :
10.1109/SFCS.1980.39
