J4 ›› 2011, Vol. 49 ›› Issue (06): 1019-1023.

Previous Articles     Next Articles

Sum of Ranks of Matrix Polynomials without Constraints

Lv Hongbin1, YANG Zhongpeng2, LI Yan3, LIN Limei4, CHEN Meixiang2, ZHONG Guoxiang5   

  1. 1. College of Mathematics, Beihua University, Jilin 132033, Jilin Province, China;2. Department of Mathematics, Putian University, Putian 351100, Fujian Province, China;3. Department of Electronic Engineering, Jilin Communications Polytechnic, Changchun 130012, China;4. School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, China;5. School of Mathematics Science and Computing Technology, Central South University, Changsha 410083, China
  • Received:2011-03-04 Online:2011-11-26 Published:2011-11-28
  • Contact: YANG Zhongpeng E-mail:yangzhongpeng@126.com

Abstract:

Using the duality of greatest common factor and least common multiple of polynomials, we obtained the identities for the sum of the ranks of finite matrix polynomials without any constraint.

Key words: matrix polynomial, identity of rank, constraint, duality

CLC Number: 

  • O151.21