-
Consider the problem of multiplying a chain of matrices
-
Given a sequence(chain) of n matrices ,
say,(C1,C2,...,Cn)
and we wish to compute the product of
C1C2...Cn
-
The manner in which we parenthesize the matrices has significant effect on the total number of scalar multiplications
-
The matrix -chain multiplication problem can be restated as : given a
chain of n matrices (C1,C2,...,Cn)
parenthesize the product C1C2...Cn
in a way that minimizes the number of scalar multiplications
-
Matrix Ci has the dimension pi-1 x p
i for i = 1,2,...,n