摘要
给出了一个求解矩阵连乘积的最优计算次序的自底向上算法,可以求出连乘矩阵的加括事情方式和最小计算次数.该算法的时间复杂度为多项式算法O(n3).
In this paper, an algorithm is provided to solve the problem of matrix chain-multiplication,which gives the minimal caleulating times and the method of Bracketing. The time complexity of this algorithms is.
出处
《甘肃高师学报》
2008年第2期16-17,共2页
Journal of Gansu Normal Colleges
关键词
矩阵连乘
算法
最优计算次序
matrix chain - multiplication
algorithms
optimizate calculating order
