Matrix Chain MultiplicationIt is a Method under Dynamic Programming in which previous output is taken as input for next. Here, Chain means one matrix's column is equal to the second matrix's row [always]. In general: If A = ⌊a_{ij}⌋ is a p x q matrix B = ⌊b_{ij}⌋ is a q x r matrix C = ⌊c_{ij}⌋ is a p x r matrix Then Given following matrices {A_{1},A_{2},A_{3},...A_{n}} and we have to perform the matrix multiplication, which can be accomplished by a series of matrix multiplications A_{1} xA_{2} x,A_{3} x.....x A_{n} Matrix Multiplication operation is associative in nature rather commutative. By this, we mean that we have to follow the above matrix order for multiplication but we are free to parenthesize the above multiplication depending upon our need. In general, for 1≤ i≤ p and 1≤ j ≤ r It can be observed that the total entries in matrix 'C' is 'pr' as the matrix is of dimension p x r Also each entry takes O (q) times to compute, thus the total time to compute all possible entries for the matrix 'C' which is a multiplication of 'A' and 'B' is proportional to the product of the dimension p q r. It is also noticed that we can save the number of operations by reordering the parenthesis. Example1: Let us have 3 matrices, A_{1},A_{2},A_{3} of order (10 x 100), (100 x 5) and (5 x 50) respectively. Three Matrices can be multiplied in two ways:
No of Scalar multiplication in Case 1 will be: No of Scalar multiplication in Case 2 will be: To find the best possible way to calculate the product, we could simply parenthesis the expression in every possible fashion and count each time how many scalar multiplication are required. Matrix Chain Multiplication Problem can be stated as "find the optimal parenthesization of a chain of matrices to be multiplied such that the number of scalar multiplication is minimized". Number of ways for parenthesizing the matrices: There are very large numbers of ways of parenthesizing these matrices. If there are n items, there are (n1) ways in which the outer most pair of parenthesis can place. (A_{1}) (A_{2},A_{3},A_{4},................A_{n}) Or (A_{1},A_{2}) (A_{3},A_{4} .................A_{n}) Or (A_{1},A_{2},A_{3}) (A_{4} ...............A_{n}) ........................ It can be observed that after splitting the kth matrices, we are left with two parenthesized sequence of matrices: one consist 'k' matrices and another consist 'nk' matrices. Now there are 'L' ways of parenthesizing the left sublist and 'R' ways of parenthesizing the right sublist then the Total will be L.R: Also p (n) = c (n1) where c (n) is the nth Catalon number c (n) = On applying Stirling's formula we have c (n) = Ω Which shows that 4^{n} grows faster, as it is an exponential function, then n^{1.5}. Development of Dynamic Programming Algorithm
Dynamic Programming ApproachLet A_{i,j} be the result of multiplying matrices i through j. It can be seen that the dimension of A_{i,j} is p_{i1} x p_{j} matrix. Dynamic Programming solution involves breaking up the problems into subproblems whose solution can be combined to solve the global problem. At the greatest level of parenthesization, we multiply two matrices A_{1.....n}=A_{1....k} x A_{k+1....n}) Thus we are left with two questions:
One possible answer to the first question for finding the best value of 'k' is to check all possible choices of 'k' and consider the best among them. But that it can be observed that checking all possibilities will lead to an exponential number of total possibilities. It can also be noticed that there exists only O (n^{2} ) different sequence of matrices, in this way do not reach the exponential growth. Step1: Structure of an optimal parenthesization: Our first step in the dynamic paradigm is to find the optimal substructure and then use it to construct an optimal solution to the problem from an optimal solution to subproblems. Let A_{i....j} where i≤ j denotes the matrix that results from evaluating the product A_{i} A_{i+1}....A_{j}. If i < j then any parenthesization of the product A_{i} A_{i+1} ......A_{j} must split that the product between A_{k} and A_{k+1} for some integer k in the range i ≤ k ≤ j. That is for some value of k, we first compute the matrices A_{i.....k} & A_{k+1....j} and then multiply them together to produce the final product A_{i....j}. The cost of computing A_{i....k} plus the cost of computing A_{k+1....j} plus the cost of multiplying them together is the cost of parenthesization. Step 2: A Recursive Solution: Let m [i, j] be the minimum number of scalar multiplication needed to compute the matrixA_{i....j}. If i=j the chain consist of just one matrix A_{i....i}=A_{i} so no scalar multiplication are necessary to compute the product. Thus m [i, j] = 0 for i= 1, 2, 3....n. If i<j we assume that to optimally parenthesize the product we split it between A_{k} and A_{k+1} where i≤ k ≤j. Then m [i,j] equals the minimum cost for computing the subproducts A_{i....k} and A_{k+1....j}+ cost of multiplying them together. We know A_{i} has dimension p_{i1} x p_{i}, so computing the product A_{i....k} and A_{k+1....j}takes p_{i1} p_{k} p_{j} scalar multiplication, we obtain m [i,j] = m [i, k] + m [k + 1, j] + p_{i1} p_{k} p_{j} There are only (j1) possible values for 'k' namely k = i, i+1.....j1. Since the optimal parenthesization must use one of these values for 'k' we need only check them all to find the best. So the minimum cost of parenthesizing the product A_{i} A_{i+1}......A_{j} becomes To construct an optimal solution, let us define s [i,j] to be the value of 'k' at which we can split the product A_{i} A_{i+1} .....A_{j} To obtain an optimal parenthesization i.e. s [i, j] = k such that m [i,j] = m [i, k] + m [k + 1, j] + p_{i1} p_{k} p_{j}
Next TopicMatrix Chain Multiplication Example
