矩阵多项式问题的两种解法
Two Solutions of Matrix Polynomial Problem
摘要: 线性代数的问题中,关于矩阵多项式的问题有很多。本文从两个观点讨论对他们的解法。并用它们分别证明线性代数中著名的Hamilton-Caylay定理与根子空间分解定理加强命题。
Abstract: 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.
文章引用:陈贺, 金长松. 矩阵多项式问题的两种解法[J]. 理论数学, 2021, 11(2): 310-312. https://doi.org/10.12677/PM.2021.112040

参考文献

[1] 胡适耕, 刘先忠. 高等代数[M]. 北京: 科学出版社, 2007.
[2] 张贤达. 矩阵分析与应用[M]. 北京: 清华大学出版社, 2004.
[3] 北京大学数学系几何与代数教研室前代数小组编. 高等代数[M]. 北京: 高等教育出版社, 2003.