On the Algebraic Structure of the Moore Penrose Inverse of Full Row or Full Column Rank Polynomial Matrices

被引:0
|
作者
Kafetzis, Ioannis S. [1 ]
Karampetakis, Nicholas P. [1 ]
机构
[1] Aristotle Univ Thessaloniki, Dept Math, Thessaloniki 54623, Greece
关键词
GENERALIZED INVERSES; RATIONAL MATRIX; SYSTEMS; COMPUTATION;
D O I
10.1109/codit.2019.8820625
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work establishes the connection between the finite and infinite algebraic structure of a full row or column rank polynomial matrix and its Moore Penrose inverse. For non-singular matrices, it is known that the inverse has no finite zeros and its finite poles are the finite zeros of the original matrix, while the infinite poles and zeros of the original matrix are the infinite zeros and poles of its inverse respectively. The fact that the Moore Penrose inverse is unique for every matrix along with the fact that for non-singular matrices it coincides with the normal inverse leads to the assumption that a similar connection holds for the structure, both finite and infinite, of the Moore Penrose inverse of a polynomial matrix. We prove that the Moore Penrose inverse of a full row or column rank polynomial matrix has no finite zeros, and that extra poles appear, compared to the non-singular case. Furthermore, we prove that the result regarding the infinite structure of non-singular matrices is extended to the case of the Moore Penrose inverse of a full rank polynomial matrix. Finally we determine a connection between the minimal indices of the polynomial matrix and its Moore Penrose inverse. The results are also presented through an illustrative example.
引用
收藏
页码:458 / 463
页数:6
相关论文
共 50 条
  • [1] Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
    Smoktunowicz, Alicja
    Wrobel, Iwona
    BIT NUMERICAL MATHEMATICS, 2012, 52 (02) : 503 - 524
  • [2] Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
    Alicja Smoktunowicz
    Iwona Wróbel
    BIT Numerical Mathematics, 2012, 52 : 503 - 524
  • [3] On the algebraic structure of the Moore-Penrose inverse of a polynomial matrix
    Kafetzis, Ioannis S.
    Karampetakis, Nicholas P.
    IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION, 2022, 39 (02) : 443 - 459
  • [4] Full Rank Decomposition and Moore-Penrose Inverse of o-Antisymmetric Matrix
    Guo, Wei
    Xia, Li
    PROCEEDINGS OF THE THIRD INTERNATIONAL WORKSHOP ON MATRIX ANALYSIS AND APPPLICATIONS, VOL 1, 2009, : 192 - 195
  • [5] Stratification of full rank polynomial matrices
    Johansson, Stefan
    Kagstrom, Bo
    Van Dooren, Paul
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439 (04) : 1062 - 1090
  • [6] On the rank structure of the Moore-Penrose inverse of singular k-banded matrices
    Bueno, M. I.
    Furtado, Susana
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 702 : 122 - 142
  • [7] Improved Gradient Neural Networks for Solving Moore–Penrose Inverse of Full-Rank Matrix
    Xuanjiao Lv
    Lin Xiao
    Zhiguo Tan
    Zhi Yang
    Junying Yuan
    Neural Processing Letters, 2019, 50 : 1993 - 2005
  • [8] Improved Gradient Neural Networks for Solving Moore-Penrose Inverse of Full-Rank Matrix
    Lv, Xuanjiao
    Xiao, Lin
    Tan, Zhiguo
    Yang, Zhi
    Yuan, Junying
    NEURAL PROCESSING LETTERS, 2019, 50 (02) : 1993 - 2005
  • [9] Full rank factorization of row(column) symmetric matrix
    Yuan, Hui-ping
    Advances in Matrix Theory and Applications, 2006, : 335 - 338
  • [10] The Moore-Penrose inverse for sums of matrices under rank additivity conditions
    Tian, Y
    LINEAR & MULTILINEAR ALGEBRA, 2005, 53 (01): : 45 - 65