关键词: 矩阵连乘, 最小连乘因子优先算法, 动态规划法, 贪心算法

Abstract: Priority factor of serial matrix multiplication is presented in the first part of the paper.Then adopting greedy selection strategy based on minimum priority factor of serial matrix multiplication，minimum serial multiplication factor first algorithm is put forward.Computation sequence obtained from this algorithm is not always optimal，but it spends less time and space than dynamic programming.Finally，the experiment result indicates that the proposed algorithm is more effective than dynamic programming for small matrixes on the whole.

Key words: serial matrix multiplication, minimum serial multiplication factor first algorithm, dynamic programming, greedy algorithm