矩阵连乘的经典问题.给顶一系列的矩阵,要求它们的乘积.由于矩阵乘法满足结合律,因此不同的结合将导致不同的效率,本程序寻求一个最佳的矩阵结合,使之获得最高的运算效率-Matrix even by the classic problems. To the top of a series of matrices, their product requirements. As a result of matrix multiplication to meet the combination of law, it will lead to a different combination of different efficiency, the procedures to seek an optimal combination of matrix, and thus obtain the highest computing efficiency相关搜索： 矩阵连乘
Matrix-chain