摘要： 本文在总结各种矩阵链乘积最优次序求解算法的基础上,对于含有行向量或列向量的矩阵链提出了一种0(n)时间最优次序求解算法。就稀疏矩阵链给出了一种随矩阵运算不断修改的最优次序求解算法。最后提出了在这方面仍需继续做的几个问题。
Abstract: Based on the conclusion about optimal evaluation algorithm of various matrix chain products, an optimal evaluation algorithm is presented which the complexity is O(n) to matrix chain containing row or column vector. An optimal evaluation algorithm which is updated continuously in operating on sparse matrix is given followed by some problems.
孙坤. 含有行或列向量的矩阵链乘积最优次序的求解[J]. , 1986, 12(03): 22-.
Sun Kun. AN OPTIMAL EVALUATION OF PRODUCT ON MATRIX CHAIN CONTAINING ROW OR COLUMN VECTOR[J]. , 1986, 12(03): 22-.