矩阵特征多项式升幂排列新方法

A New Method to Asceding Ordered Arramgement for Eigenpolynomial of Matrix

利用矩阵初等变换方法和高次方程同解变形方法,给出一个将矩阵特征多项式表示成升幂排列多项式的新的数值计算方法,分析此方法的计算复杂度、空间复杂度、数值稳定性和内在并行性,探讨此方法在求解矩阵特征值问题研究中的应用前景.

Making use of the elementary transformation method of a matrix and the equivalent substitution method of an equation of higher degree,the author put forward a new numerical method to ascending ordered arrangement for the eigenpolynomial of a matrix,also discussed its computational complexity,spatial complexity,numerical stability and intrinsic parallism,so did with its applied prospects on the studying of solving the eigenvalue problem of a matrix.