首页 | 官方网站   微博 | 高级检索  
     

高次伴随矩形的求法及其特征根
引用本文:林玎,刘伟. 高次伴随矩形的求法及其特征根[J]. 吉林建筑工程学院学报, 2001, 0(1): 59-62
作者姓名:林玎  刘伟
作者单位:吉林建筑工程学院基础部,长春,130021
摘    要:由数域F上任意n阶矩阵A可得一个伴随矩阵A(或记为(A)),我们称A为A的一次伴随,对A来讲又有伴矩阵A,称为A的二次伴随。一般地,一个n阶矩阵A有任意m次伴随,为了书写方便,我们把A的m次伴随记为A^(m)(相应地A记为A^(2))。对于二次以上(包括二次)的伴随矩阵,我们统称为高次伴随矩阵。本给出求高次伴随矩阵及其特征根的公式。

关 键 词:高次伴随矩阵 高次伴随矩阵公式 特征根
文章编号:1009-0185(2001)01-0059-04
修稿时间:2000-11-06

The Way to Computer Higher Degree Adjoint Matrixand its Latent Roots
LIN Ding,LIU Wei. The Way to Computer Higher Degree Adjoint Matrixand its Latent Roots[J]. Journal of Jilin Architectural and Civil Engineering, 2001, 0(1): 59-62
Authors:LIN Ding  LIU Wei
Abstract:Abstract:We could get an adjoint matrix A, (or(A)~ ), according to a random the nth matrixA, on field F, which we called it the once concomitance for A, there is an adjoint matrix A forA,which is called the twice concomitance for A. In the general, there are random m timesconcomitance for the nth matrix A, for writing convenience, we write m times concomitancefor A as A~(m), (ie A as A~(2). )We called them higher degree adjoint for more than two times(including two times). This paper introduced the ways how to compute higher degree adjointmatrix arid the formula of its latent roots.
Keywords:Keywords: higher degree adjoint matrix  formula of higher degree adjoint matrix  latent roots  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号