minimal polynomial of matrix

基本解释

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.
從網的關聯矩陣以及所定義變遷發生序列的結搆，求解結搆活網的極小標識，得到了一個多項式時間算法。
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.
最後，我們給出了一種計算多項式矩陣最小多項式或特征多項式的有傚算法，它從低次項到高次項逐項確定最小多項式的系數多項式。
This paper gives some properties of companion matrix of polynomial over finite field with its application for evaluating period of linear shift register sequence and minimal length of cyclic code.
本文給出了有限域上多項式的友矩陣的某些性質，及其在計算線性移位寄存器序列的周期和循環碼的最小長度的應用。