摘要
矩阵乘法是一种应用十分广泛的基本的运算之一 ,提高矩阵的运算速度有利于减少许多科学及工程领域计算问题的时间耗费 ,通过对矩阵乘法的Strassen算法及其时间复杂性等问题进行分析及总结 ;以实现动态规划法用于寻找矩阵链乘的最优乘积次序算法 .
The multiplication of matrices is one of the most basic operations of algebra and scientific computing and has provided an important focus in search for methods to speed up scientific computation. This paper first instruduces Strassens algorithm for multiplication of two matrices, and then uses dynamic programming to arrange the optimal multiplying order for matrix-chain multiplication.
出处
《韶关学院学报》
2001年第9期6-9,共4页
Journal of Shaoguan University
