矩阵多项式问题的两种解法  

Two Solutions of Matrix Polynomial Problem

作　　者：陈贺 金长松 

机构地区：[1]东北大学秦皇岛分校,数学与统计学院,河北 秦皇岛

出　　处：《理论数学》2021年第2期310-312,共3页Pure Mathematics

摘　　要：线性代数的问题中,关于矩阵多项式的问题有很多。本文从两个观点讨论对他们的解法。并用它们分别证明线性代数中著名的Hamilton-Caylay定理与根子空间分解定理加强命题。Among the problems of linear algebra, there are many problems about matrix polynomials. This article discusses their solutions from two viewpoints. And we use them to prove the famous Ham-ilton-Caylay Theorem and root subspace decomposition theorem in linear algebra to strengthen the proposition.

关 键 词：矩阵多项式 若尔当标准型 Hamilton-Caylay定理 根子空间分解定理 

分 类 号：O15[理学—数学]