High Impact Factor : 4.396 icon | Submit Manuscript Online icon | UGC Approved icon

A Novel Approach for solving Matrix Chain Product


Rajeshkumar Pradhan , GEC Modasa; Rajeshkumar Pradhan, GEC Modasa; Sanjay Shah, GEC Modasa


Matrix Chain Product


The Matrix chain product or (Matrix Chain multiplication) problem is the most famous illustration of dynamic approach of algorithm design. The matrix chain product problem tries to obtain the optimal sequence for doing a series of operations. The need for solving Matrix Chain Product problem is given a chain of matrices to multiply, obtain the fewest number of multiplications required to calculate the product. The original time complexity of Matrix Chain Product which uses Dynamic Programming to get the Multiplication cost is O(n3) which consumes more resources. Using Proposed novel approach we can reduce it to O(n2) which will save resource consumption and give us the result in lesser time.

Other Details

Published in: Conference 10 : NCACSET 2017
Publication Date: 06/05/2017
Page(s): 107-111

Article Preview

Download Article