反三角算子矩阵的Drazin可逆性及其表示
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:The Drazin Inverse and Representation of the Anti-triangular Operator Matrix
  • 作者:韩叶清 ; 王华
  • 英文作者:HAN Yeqing;WANG Hua;College of Sciences,Inner Mongolia University of Technology;
  • 关键词:Drazin逆 ; 预解式 ; Laurent展开 ; 有界线性算子
  • 英文关键词:Drazin inverse;;resolvent;;Laurent expansion;;bounded linear operator
  • 中文刊名:YYFH
  • 英文刊名:Acta Analysis Functionalis Applicata
  • 机构:内蒙古工业大学理学院数学系;
  • 出版日期:2019-03-15
  • 出版单位:应用泛函分析学报
  • 年:2019
  • 期:v.21
  • 基金:国家自然科学基金(11461049,11601249);; 内蒙古自然科学基金(2018MS01002,2017MS0118)
  • 语种:中文;
  • 页:YYFH201901003
  • 页数:13
  • CN:01
  • ISSN:11-4016/TL
  • 分类号:37-49
摘要
本文讨论了反三角算子矩阵■的Drazin可逆性及其Drazin逆的表达式.在CB=CAB=CA~2B,A~3=A~2条件下,采用预解式的Laurent展开方法证明了反三角算子矩阵M是Drazin可逆的,并给出M的含有A~D和(CB)~D的Drazin逆的表达式.最后给出算例,说明了结果的有效性.
        In this paper, we study the existence and representation of the Drazin inverse of the anti-triangular operator matrix ■.Based on Laurent expansion method of resolvent, we prove that M is Drazin invertible under the assumptions CB=CAB=CA~2B, A~3=A~2, and the expression of Drazin inverse of M in terms of A~D and (CB)~D is also given. Finally, an example is presented to illustrate the validity of the main result.
引文
[1]Drazin M P. Pseudo-inverses in associative rings and semigroups[J]. The American Mathematical Monthly,1958, 65(7):506-514.
    [2]Meyer C D, Shoaf J M. Updating finite Markov chains by using techniques of group matrix inversion[J].Journal of Statistical Computation and Simulation, 1980, 11(3-4):163-181.
    [3]Cui X K, Wei Y M, Zhang N M. Quotient convergence and multi-splitting methods for solving singular linear equations[J]. Calcolo, 2007, 44(1):21-31.
    [4]Eiermann M, Marek I, Niethammer W. On the solution of singular linear systems of algebraic equations by semi-iterative methods[M]. Springer-Verlag New York, Inc, 1988, 53(4):265-283.
    [5]Campbell S L. The Drazin inverse and systems of second order linear differential equations[J]. Linear and Multilinear Algebra, 1983, 14(2):195-198.
    [6]Castro-González N,Dopazo E. Representations of the Drazin inverse for a class of block matrices[J]. Linear Algebra and Its Applications, 2005, 400(1):253-269.
    [7]Deng C Y, Wei Y M. A note on the Drazin inverse of an anti-triangular matrix[J]. Linear Algebra and Its Applications, 2009, 431(10):1910-1922.
    [8]Bu C J, Zhao J M, Tang J P. Representation of the Drazin inverse for special block matrix[J]. Applied Mathematics and Computation, 2011, 217(10):4935-4943.
    [9]Bu C J, Zhang K E, Zhao J M. Representations of the Drazin inverse on solution of a class singular differential equations[J]. Linear and Multilinear Algebra, 2011, 59(8):863-877.
    [10]Huang J J, Shi Y F, Chen A. The representation of the Drazin inverse of anti-triangular operator matrices based on resolvent expansions[J]. Applied Mathematics and Computation, 2014, 242:196-201.
    [11]Yu A Q, Deng C Y, Wang X N. On the Drazin inverse of anti-triangular block matrices[J]. Linear Algebra and Its Applications, 2016, 489:274-287.
    [12]Yang H, Liu X F. The Drazin inverse of the sum of two matrices and its applications[J]. Journal of Computation and Applied Mathematics, 2011, 235(5):1412-1417.
    [13]Wei Y M. Expressions for the Drazin inverse of a 2 x 2 block matrix[J]. Linear and Multiple Algebra, 1998,45(2-3):131-146.
    [14]Ge Y L, Zhang H Y, Sheng Y Q, et al. Group inverse for two classes of 2 x 2 anti-triangular block matrices over right Ore domains[J]. Journal of Applied Mathematics and Computing, 2013, 42(1-2):183-191.
    [15]Marek I, Szyld D B. Iterative and semi-itative methods for computing stationary probability vectors of Markov operators[J]. Mathematics of Computation, 1993, 61(204):719-731.
    [16]Caradus S R. Generalized inverses and operator theory[J]. Queen's Papers in Pure and Applied Mathematics,Queen's Unversity,Kingston, Ontario,1974(38).
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.