• DocumentCode
    615356
  • Title

    Efficient computation of matrix chain

  • Author

    Xiaodong Wang ; Daxin Zhu ; Jun Tian

  • Author_Institution
    Fac. of Math. & Comput. Sci., Quanzhou Normal Univ., Quanzhou, China
  • fYear
    2013
  • fDate
    26-28 April 2013
  • Firstpage
    703
  • Lastpage
    707
  • Abstract
    We consider the matrix chain ordering problem to determine the optimal computation order of the matrix chain products. A new algorithm for the matrix chain ordering problem is presented. The time complexity of the presented algorithm is O(n log m), where n is the number of matrices in the chain and m is the number of local minimums in the dimension sequence of the given matrix chain. When m is a fixed constant, the new algorithm requires only O(n) time.
  • Keywords
    computational complexity; matrix algebra; O(n log m) time complexity; O(n) time complexity; local minimums; matrix chain dimension sequence; matrix chain ordering problem; optimal matrix chain computation order; Computers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science & Education (ICCSE), 2013 8th International Conference on
  • Conference_Location
    Colombo
  • Print_ISBN
    978-1-4673-4464-7
  • Type

    conf

  • DOI
    10.1109/ICCSE.2013.6553999
  • Filename
    6553999
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=615356