Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.
最后，我们给出了一种计算多项式矩阵最小多项式或特征多项式的有效算法，它从低次项到高次项逐项确定最小多项式的系数多项式。
A polynomial algorithm about minimal marking of structural live Petri nets is presented, it is based on incidence matrix and the constructive of transitions sequence.
从网的关联矩阵以及所定义变迁发生序列的结构，求解结构活网的极小标识，得到了一个多项式时间算法。
A polynomial algorithm about minimal marking of structural live Petri nets is presented, it is based on incidence matrix and the constructive of transitions sequence.
从网的关联矩阵以及所定义变迁发生序列的结构，求解结构活网的极小标识，得到了一个多项式时间算法。
应用推荐