BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-81-875
       ENTRY:: June 05, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Computation of matrix chain products: Part I, Part II
        TYPE:: Technical Report
      AUTHOR:: Hu, T. C.
      AUTHOR:: Shing, M. T.
        DATE:: September 1981
       PAGES:: 128
    ABSTRACT:: This paper considers the computation of matrix chain products
               of the form $M_1 x M_2 x ... x M_{n-1}$. If the matrices are
               of different dimensions, the order in which the product is
               computed affects the number of operations. An optimum order
               is an order which minimizes the total number of operations.
               Some theorems about an optimum order of computing the
               matrices are presented in part I. Based on these theorems, an
               O(n log n) algorithm for finding an optimum order is
               presented in part II.
       NOTES:: [Adminitrivia V1/Prg/19950605]
         END:: STAN//CS-TR-81-875