| 一种动态编程法解决矩阵链相乘问题 |
| |
| 引用本文： | 吴昆 余成. 一种动态编程法解决矩阵链相乘问题[J]. 东莞理工学院学报, 2005, 12(5): 52-56 |
| |
| 作者姓名： | 吴昆 余成 |
| |
| 作者单位： | 东莞理工学院电子系,广东东莞523808 |
| |
| 摘 要： | 文章介绍一种新的动态编程法解决矩阵链相乘问题,动态编程法可以极大节省计算成本及资源,通过实验程序结果证明,用动态编程法解决矩阵相乘问题相对于一般正常的算法,计算效率得到极大提高.
|
| 关 键 词： | 动态编程法 矩阵链相乘 分解和控制法 |
| 文章编号： | 1009-0312（2005）05-0052-05 |
| 收稿时间： | 2005-02-15 |
| 修稿时间： | 2005-02-15 |
A Dynamic Programming Approach to Solve Matrix Chain Multiplication |
| |
| Wu Kun, Yu Cheng. A Dynamic Programming Approach to Solve Matrix Chain Multiplication[J]. Journal of Dongguan Institute of Technology, 2005, 12(5): 52-56 |
| |
| Authors: | Wu Kun Yu Cheng |
| |
| Abstract: | This paper introduces a new method to calculate matrix chain multiplication problem using dynamic programming approach. Dynamic programming proves to be an effective method in solving current computer science problems, its application can be used in many feilds to optimize computing cost, such as computing time and space. Experiments and progragms with matrix chain multiplication are provided to illustrate the method. The results show that significant improvements on computing resources savings are obtained compared with brutal force implementation of matrix multiplication. |
| |
| Keywords: | dynamic programming matrix chain multiplication divide and conquer |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
