This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
The matrix chain multiplication problem – a new approach
Authors
  Mrs. Analpa Ranade
Abstract
Matrix chain multiplication is a classic problem in dynamic programming for ordering the chain of matrices to get the minimal number of calculations while multiplying. Here the author propose a new method to determine the multiplication sequence and bracketing which results in optimal solution. This method is easy to understand, implement and also saves time and calculations compared to the traditional method
Keywords- matrix, matrix multiplication, matrix chain multiplication, dynamic programming
Publication Details
Unique Identification Number - IJEDR1903153Page Number(s) - 895-897Pubished in - Volume 7 | Issue 3 | September 2019DOI (Digital Object Identifier) -    Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  Mrs. Analpa Ranade,   "The matrix chain multiplication problem – a new approach", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.7, Issue 3, pp.895-897, September 2019, Available at :http://www.ijedr.org/papers/IJEDR1903153.pdf
Article Preview
|
|
||||||
|