Our aim is to present new expressions for the Drazin inverse of anti-triangular block matrices under some circumstances. Applying the established new formulae for anti-triangular block matrices, we derive explicit representations for the Drazin inverse of a 2×2 complex block matrix under corresponding assumptions. We extend several well known results in the literature in this way.
Citation: Daochang Zhang, Dijana Mosić, Liangyun Chen. On the Drazin inverse of anti-triangular block matrices[J]. Electronic Research Archive, 2022, 30(7): 2428-2445. doi: 10.3934/era.2022124
[1] | D. Mosić, P. S. Stanimirović, L. A. Kazakovtsev . The $ m $-weak group inverse for rectangular matrices. Electronic Research Archive, 2024, 32(3): 1822-1843. doi: 10.3934/era.2024083 |
[2] | Yongge Tian . Characterizations of matrix equalities involving the sums and products of multiple matrices and their generalized inverse. Electronic Research Archive, 2023, 31(9): 5866-5893. doi: 10.3934/era.2023298 |
[3] | Jia-Min Luo, Hou-Biao Li, Wei-Bo Wei . Block splitting preconditioner for time-space fractional diffusion equations. Electronic Research Archive, 2022, 30(3): 780-797. doi: 10.3934/era.2022041 |
[4] | Xiuhai Fei, Haifang Zhang . Additivity of nonlinear higher anti-derivable mappings on generalized matrix algebras. Electronic Research Archive, 2023, 31(11): 6898-6912. doi: 10.3934/era.2023349 |
[5] | Xiu-Jian Wang, Jia-Bao Liu . Quasi-tilted property of generalized lower triangular matrix algebras. Electronic Research Archive, 2025, 33(5): 3065-3073. doi: 10.3934/era.2025134 |
[6] | Asima Razzaque, Abdul Razaq, Sheikh Muhammad Farooq, Ibtisam Masmali, Muhammad Iftikhar Faraz . An efficient S-box design scheme for image encryption based on the combination of a coset graph and a matrix transformer. Electronic Research Archive, 2023, 31(5): 2708-2732. doi: 10.3934/era.2023137 |
[7] | Wenya Shi, Xinpeng Yan, Zhan Huan . Faster free pseudoinverse greedy block Kaczmarz method for image recovery. Electronic Research Archive, 2024, 32(6): 3973-3988. doi: 10.3934/era.2024178 |
[8] | Xing Zhang, Xiaoyu Jiang, Zhaolin Jiang, Heejung Byun . Algorithms for solving a class of real quasi-symmetric Toeplitz linear systems and its applications. Electronic Research Archive, 2023, 31(4): 1966-1981. doi: 10.3934/era.2023101 |
[9] | Xinzheng Xu, Yanyan Ding, Zhenhu Lv, Zhongnian Li, Renke Sun . Optimized pointwise convolution operation by Ghost blocks. Electronic Research Archive, 2023, 31(6): 3187-3199. doi: 10.3934/era.2023161 |
[10] | Ranran Li, Hao Liu . On global randomized block Kaczmarz method for image reconstruction. Electronic Research Archive, 2022, 30(4): 1442-1453. doi: 10.3934/era.2022075 |
Our aim is to present new expressions for the Drazin inverse of anti-triangular block matrices under some circumstances. Applying the established new formulae for anti-triangular block matrices, we derive explicit representations for the Drazin inverse of a 2×2 complex block matrix under corresponding assumptions. We extend several well known results in the literature in this way.
The Drazin inverse is a very useful tool in various fields of applied mathematics such as Markov chains, control theory, iterative methods in numerical linear algebra, singular differential and difference equations [1,2,3]. There are many researches about finding expressions of the Drazin inverse of a block matrix under certain conditions [4,5], but it is still an open problem proposed by Campbell and Meyer [6] in 1979.
It is well known that the Drazin inverse of a square complex matrix A is the unique matrix Ad for which the following equations hold
AAd=AdA,AdAAd=Ad,Ak=Ak+1Ad, |
where k is the index of A (i.e., the smallest non-negative integer such that rank(Ak)=rank(Ak+1)) and denoted by ind(A). Recall that Ae=AAd, and Aπ=I−Ae is the spectral idempotent of A corresponding to {0}. Because A0=I, for the identity matrix I of the proper size, and (Ad)n=(An)d for any non-negative integer n, we adopt the conventions that Adn=And=(Ad)n. Some interesting results related to the Drazin inverse can be found in [7,8,9,10,11].
Under adequate restrictions, various representations for the Drazin inverse of a 2×2 complex block matrix
M=[ABCD] | (1.1) |
are proved and we list some of them:
1. in [12], BC=0,BD=0 and DC=0;
2. in [13], BC=0,BDC=0 and BD2=0;
3. in [14], BC=0,DC=0 (or BD=0) and D is nilpotent;
4. in [15], A=0 and D=0;
5. in [16], ABC=0,DC=0 and BD=0 (or BC is nilpotent, or D is nilpotent);
6. in [17], ABC=0,CBC=0 and BD=0;
7. in [18], ABC=0 and BD=0 (or DC=0).
Let us recall that the solutions to singular systems of differential equations are determined by the formula for the Drazin inverse of an anti-triangular block matrix. We consider the following anti-triangular block matrices:
ˉN=[ABI0] | (1.2) |
and
N=[ABC0]. | (1.3) |
Several interesting investigations related to the Drazin inverse of the anti-triangular block matrix N partitioned as in the form (1.3) can be seen in [19,20,21,22,23,24,25]. Under assumptions AB=0 and ABC=0, the formulae for the Drazin inverse of the anti-triangular block matrix N given by (1.3), were respectively proved in [26]. Also, note that the Drazin inverse of ˜N=[AIB0] was studied in [27,28,29].
The first goal of this paper is to present a new formula for the Drazin inverse of ˉN in the case that A3B=0, BAB=0 and BA2B=0. Applying this new formula and the splitting of N in terms of ˉN, we get the expression for Nd which recovers some earlier results from [26]. Then, using the obtained formula for the Drazin inverse of N, we obtain explicit expressions for the Drazin inverse of M under corresponding assumptions and extend several results in the literature in this manner.
The symbol Cm×n presents the set of all m×n complex matrices and all matrices are proper sizes over Cm×n in this paper. If the lower limit of a sum is greater than its upper limit, we define the sum to be 0, i.e., for example, the sum −1∑n=0∗=0. Notice that [x] stands for the truncates integer of x.
Some auxiliary results concerning the Drazin inverse, which will be often used, are given in this section.
Firstly, the so-called Cline's formula is stated.
Lemma 2.1. [30] (Cline's Formula) For A∈Cm×n and B∈Cn×m, (BA)d=B[(AB)2d]A.
We cite one important result about the Drazin inverse of anti-triangular block matrices as follows.
Lemma 2.2. [31,32] Let M=[AB0D] and N=[D0BA]∈Cn×n, where A and D are square matrices such that r=ind(A) and s=ind(D). Then
Md=[AdX0Dd]andNd=[Dd0XAd], |
where
X=s−1∑i=0A(i+2)dBDiDπ+Aπr−1∑i=0AiBD(i+2)d−AdBDd. |
The following expressions for the Drazin inverse of the sum of two matrices proved in [33], are very useful.
Lemma 2.3. [33,Theorem 2.2] Let QPQ=0 and P2Q=0, where P,Q∈Cn×n, ind(P)=r and ind(Q)=s. Then
(P+Q)d=Qπs−1∑i=0QiP(i+1)d+r−1∑i=0Q(i+1)dPiPπ+Pr−1∑i=0Q(i+2)dPiPπ+PQπs−2∑i=0Qi+1P(i+3)d−PQdPd−PQQdP2d. | (2.1) |
Lemma 2.4. [33,Theorem 2.1] Let PQP=0 and PQ2=0, where P,Q∈Cn×n, ind(P)=r and ind(Q)=s. Then
(P+Q)d=Qπs−1∑i=0QiP(i+1)d+r−1∑i=0Q(i+1)dPiPπ+Qπs−1∑i=0QiP(i+2)dQ+r−2∑i=0Q(i+3)dPi+1PπQ−QdPdQ−Q2dPPdQ. | (2.2) |
The aim of this section is to derive the representations for the Drazin inverse of N expressed by (1.3) under new conditions in the literature. To establish the representations of Nd, we obtain our first main result considering the Drazin inverse of ˉN, which is given as in (1.2), in the case that A3B=0, BAB=0 and BA2B=0.
Theorem 3.1. Let ˉN be a matrix of the form (1.2), where A and B are square matrices of the same size such that ind(A)=r and ind(B)=s. If
A3B=0,BAB=0andBA2B=0, |
then
ˉNd=[E1A2Bd+BBdE3ABd], |
where
E1=ABπs−1∑i=0BiA(2i+2)d+A2Bπs−1∑i=0BiA(2i+3)d+Bπs−1∑i=0BiA(2i+1)d+A2[r2]∑i=1B(i+1)dA2i−1Aπ+A[r2]∑i=0B(i+1)dA2iAπ+[r2]∑i=1BidA2i−1Aπ−A2BdAd−2Ad,E3=Bπs−1∑i=0BiA(2i+2)d+ABπs−1∑i=0BiA(2i+3)d+A2Bπs−1∑i=0BiA(2i+4)d+[r2]∑i=0B(i+1)dA2iAπ+A[r2]∑i=1B(i+1)dA2i−1Aπ+A2[r2]∑i=0B(i+2)dA2iAπ−ABdAd−A2BdA2d−2A2d. |
Proof. The next splitting of ˉN2 will be used:
ˉN2=[A2+BABAB]=[A20A0]+[BAB0B]:=P+Q. |
By Lemma 2.2, we get
Pd=[A2d0A3d0]andQd=[BdABd0Bd]. |
Then we verify that
Pπ=[Aπ0−AdI]andQπ=[Bπ−ABe0Bπ]. |
For any n≥1, we observe that
Pn=[A2n0A2n−10],Qn=[BnABn0Bn], |
and
Pnd=[A(2n)d0A(2n+1)d0],Qnd=[BndABnd0Bnd]. |
Since ind(A)=r and ind(B)=s, it is clearly that r and s are respectively the least nonnegative integers as follows
ArAπ=0,BsBπ=0. |
One can observe that
r−2≤2[r2]−1≤r−1,r−1≤2[r2]≤randr≤2[r2]+1≤r+1 |
for any nonnegative integer r. Notice that, for i≥1,
PiPπ=[A2i0A2i−10][Aπ0−AdI]=[A2iAπ0A2i−1Aπ0], |
and
QiQπ=[BiABi0Bi][Bπ−ABe0Bπ]=[BiBπABiBπ0BiBπ]. |
So, we conclude that ind(P)=[r2]+1 and ind(Q)=s. Because the assumptions P2Q=0 and QPQ=0 of Lemma 2.3 are satisfied, we calculate the following terms as in (2.1):
Qπs−1∑i=0QiP(i+1)d=[ Bπs−1∑i=0BiA(2i+2)d+As−1∑i=1BiA(2i+3)d−ABes−1∑i=0BiA(2i+3)d0 Bπs−1∑i=0BiA(2i+3)d0], |
[r2]∑i=0Q(i+1)dPiPπ=[[r2]∑i=0B(i+1)dA2iAπ+A[r2]∑i=1B(i+1)dA2i−1Aπ−ABdAdABd[r2]∑i=1B(i+1)dA2i−1Aπ−BdAdBd], |
P[r2]∑i=0Q(i+2)dPiPπ=[ A2[r2]∑i=0B(i+2)dA2iAπ0 A[r2]∑i=0B(i+2)dA2iAπ+A2[r2]∑i=1B(i+2)dA2i−1Aπ−A2B2dAdA2B2d], |
PQπs−2∑i=0Qi+1P(i+3)d=[A2Bπs−2∑i=0Bi+1A(2i+6)d0ABπs−2∑i=0Bi+1A(2i+6)d+A2Bπs−2∑i=0Bi+1A(2i+7)d0], |
PQdPd=[A2BdA2d0ABdA2d+A2BdA3d0] |
and
PQQdP2d=[A2BBdA4d0ABBdA4d+A2BBdA5d0]. |
Substituting the above expressions into (2.1), we get
ˉN2d=(P+Q)d=[αβγδ], |
where
α=Bπs−1∑i=0BiA(2i+2)d+As−1∑i=1BiA(2i+3)d−ABes−1∑i=0BiA(2i+3)d+A2Bπs−2∑i=0Bi+1A(2i+6)d+A[r2]∑i=1B(i+1)dA2i−1Aπ+A2[r2]∑i=0B(i+2)dA2iAπ+[r2]∑i=0B(i+1)dA2iAπ−A2BdA2d−A2BBdA4d−ABdAd,β=ABd,γ=Bπs−1∑i=0BiA(2i+3)d+ABπs−2∑i=0Bi+1A(2i+6)d+A2Bπs−2∑i=0Bi+1A(2i+7)d+[r2]∑i=1B(i+1)dA2i−1Aπ+A[r2]∑i=0B(i+2)dA2iAπ+A2[r2]∑i=1B(i+2)dA2i−1Aπ−ABdA2d−A2BdA3d−ABBdA4d−A2BBdA5d−A2B2dAd−BdAd,δ=Bd+A2B2d. |
Computing ˉNd=ˉNˉN2d, we obtain
ˉNd=[E1E2E3E4], |
where
E1=ABπs−1∑i=0BiA(2i+2)d+A2s−1∑i=1BiA(2i+3)d−A2Bes−1∑i=0BiA(2i+3)d+Bπs−1∑i=0Bi+1A(2i+3)d+A2[r2]∑i=1B(i+1)dA2i−1Aπ+[r2]∑i=1BidA2i−1Aπ+A[r2]∑i=0B(i+1)dA2iAπ−A2BdAd−BeAd,E2=A2Bd+BBd,E3=Bπs−1∑i=0BiA(2i+2)d+As−1∑i=1BiA(2i+3)d−ABes−1∑i=0BiA(2i+3)d+A2Bπs−2∑i=0Bi+1A(2i+6)d+A[r2]∑i=1B(i+1)dA2i−1Aπ+A2[r2]∑i=0B(i+2)dA2iAπ+[r2]∑i=0B(i+1)dA2iAπ−A2BdA2d−A2BBdA4d−ABdAd,E4=ABd. |
We finish this proof by modulating appropriately the upper and lower limits of the corresponding sums.
By direct calculations, we can obtain the following corollary using Theorem 3.1.
Corollary 3.2. Let ˉN be a matrix of the form (1.2), where A and B are square matrices of the same size such that ind(A)=r and ind(BC)=s. If A2B=0 and BAB=0, then
ˉNd=[E1BBdE3ABd], |
where
E1=ABπs−1∑i=0BiA(2i+2)d+Bπs−1∑i=0BiA(2i+1)d+A[r2]∑i=0B(i+1)dA2iAπ+[r2]∑i=1BidA2i−1Aπ−Ad,E3=Bπs−1∑i=0BiA(2i+2)d+ABπs−1∑i=0BiA(2i+3)d+[r2]∑i=0B(i+1)dA2iAπ+A[r2]∑i=1B(i+1)dA2i−1Aπ−ABdAd−A2d. |
A natural motivation is from the Drazin inverse of ˉN to give a new expression for the Drazin inverse of N.
Theorem 3.3. Let N be a matrix of the form (1.3), where A and BC are square matrices of the same size such that ind(A)=r and ind(BC)=s. If
A3BC=0,BCABC=0andBCA2BC=0, |
then
Nd=[F1F2F3F4], | (3.1) |
where
F1=A(BC)πs−1∑i=0(BC)iA(2i+2)d+A2(BC)πs−1∑i=0(BC)iA(2i+3)d+(BC)πs−1∑i=0(BC)iA(2i+1)d+A[r2]∑i=0(BC)(i+1)dA2iAπ+A2[r2]∑i=0(BC)(i+2)dA2i+1Aπ+[r2]∑i=0(BC)(i+1)dA2i+1Aπ−A2(BC)dAd−2Ad,F2=A(BC)πs−1∑i=0(BC)iA(2i+3)dB+(BC)πs−1∑i=0(BC)iA(2i+2)dB+A2(BC)πs−1∑i=0(BC)iA(2i+4)dB+A[r2]∑i=1(BC)(i+1)dA2i−1AπB+A2[r2]∑i=0(BC)(i+2)dA2iAπB+[r2]∑i=0(BC)(i+1)dA2iAπB−2A2dB−A2(BC)dA2dB−A(BC)dAdB,F3=CA(BC)πs−1∑i=0(BC)iA(2i+3)d+CA2s−1∑i=0(BC)i(BC)πA(2i+4)d+C(BC)πs−1∑i=0(BC)iA(2i+2)d+C[r2]∑i=0(BC)(i+1)dA2iAπ+CA2[r2]∑i=0(BC)(i+2)dA2iAπ+CA[r2]∑i=0(BC)(i+2)dA2i+1Aπ−2CA2d−CA(BC)dAd−CA2(BC)dA2d,F4=CA(BC)πs−1∑i=0(BC)iA(2i+4)dB+CA2s−1∑i=0(BC)i(BC)πA(2i+5)dB+C(BC)πs−1∑i=0(BC)iA(2i+3)dB+C[r2]∑i=1(BC)(i+1)dA2i−1AπB+CA2[r2]∑i=1(BC)(i+2)dA2i−1AπB+CA[r2]∑i=0(BC)(i+2)dA2iAπB−2CA3dB−C(BC)dAdB−CA(BC)dA2dB−CA2(BC)2dAdB−CA2(BC)dA3dB. |
Proof. We denote by P and Q, respectively, the left matrix and the right matrix of the right-hand side of the next splitting of N:
N=[I00C][ABI0]. |
Thus,
QP=[ABCI0], |
and, applying Theorem 3.1, we have
(QP)d=[λμνξ], |
where ind(A)=r, ind(BC)=s,
λ=A(BC)πs−1∑i=0(BC)iA(2i+2)d+A2(BC)πs−1∑i=0(BC)iA(2i+3)d+(BC)πs−1∑i=0(BC)iA(2i+1)d+A2[r2]∑i=1(BC)(i+1)dA2i−1Aπ+A[r2]∑i=0(BC)(i+1)dA2iAπ+[r2]∑i=1(BC)idA2i−1Aπ−A2(BC)dAd−2Ad,μ=A2(BC)d+BC(BC)d,ν=(BC)πs−1∑i=0(BC)iA(2i+2)d+A(BC)πs−1∑i=0(BC)iA(2i+3)d+A2(BC)πs−1∑i=0(BC)iA(2i+4)d+[r2]∑i=0(BC)(i+1)dA2iAπ+A[r2]∑i=1(BC)(i+1)dA2i−1Aπ+A2[r2]∑i=0(BC)(i+2)dA2iAπ−A(BC)dAd−A2(BC)dA2d−2A2d,ξ=A(BC)d. |
According to Lemma 2.1, notice that
Nd=P(QP)2dQ=[λ2A+μνA+λμ+μξλ2B+μνBCνλA+CξνA+Cνμ+Cξ2CνλB+CξνB]. | (3.2) |
By direct computations, we obtain ξ2=0, μξ=0,
λ2=A(BC)πs−1∑i=0(BC)iA(2i+3)d+A2s−1∑i=1(BC)iA(2i+4)d−A2(BC)es−1∑i=0(BC)iA(2i+4)d+s−1∑i=0(BC)i+1(BC)πA(2i+4)d+A[r2]∑i=1(BC)(i+1)dA2i−1Aπ−A(BC)dAd−A2(BC)dA2d−(BC)eA2d,μν=A2[r2]∑i=0(BC)(i+2)dA2iAπ+[r2]∑i=0(BC)(i+1)dA2iAπ,λμ=A(BC)d,νλ=A(BC)πs−1∑i=0(BC)iA(2i+4)d+A2s−1∑i=0(BC)i(BC)πA(2i+5)d+(BC)πs−1∑i=0(BC)iA(2i+3)d+[r2]∑i=1(BC)(i+1)dA2i−1Aπ+A2[r2]∑i=1(BC)(i+2)dA2i−1Aπ−2A3d−(BC)dAd−A(BC)dA2d−A2(BC)2dAd−A2(BC)dA3d,νμ=(BC)d+A2(BC)2d,ξν=A[r2]∑i=0(BC)(i+2)dA2iAπ. |
The proof is finished by substituting the above expressions into (3.2).
Several particular consequences of our main result are investigated now. We combine Theorem 3.3 and routine computations to obtain the following expressions for the Drazin inverse of N as in (1.3).
Corollary 3.4. Let N be a matrix of the form (1.3), where A and BC are square matrices of the same size such that ind(A)=r and ind(BC)=s. If A2BC=0 and CABC=0, then
Nd=[F1F2F3F4], |
where
F1=A(BC)πs−1∑i=0(BC)iA(2i+2)d+(BC)πs−1∑i=0(BC)iA(2i+1)d+A[r2]∑i=0(BC)(i+1)dA2iAπ+[r2]∑i=0(BC)(i+1)dA2i+1Aπ−Ad,F2=A(BC)πs−1∑i=0(BC)iA(2i+3)dB+(BC)πs−1∑i=0(BC)iA(2i+2)dB+A[r2]∑i=1(BC)(i+1)dA2i−1AπB+[r2]∑i=0(BC)(i+1)dA2iAπB−A(BC)dAdB−A2dB,F3=C(BC)πs−1∑i=0(BC)iA(2i+2)d+C[r2]∑i=0(BC)(i+1)dA2iAπ,F4=C(BC)πs−1∑i=0(BC)iA(2i+3)dB+C[r2]∑i=1(BC)(i+1)dA2i−1AπB−C(BC)dAdB. |
The following corollary presents a special case of Corollary 3.4.
Corollary 3.5. Let N be a matrix of the form (1.3), where A and BC are square matrices of the same size such that ind(A)=r and ind(BC)=s. If A2B=0 and CAB=0, then
Nd=[F1(BC)dBF30], |
where
F1=A(BC)πs−1∑i=0(BC)iA(2i+2)d+(BC)πs−1∑i=0(BC)iA(2i+1)d+A[r2]∑i=0(BC)(i+1)dA2iAπ+[r2]∑i=0(BC)(i+1)dA2i+1Aπ−Ad,F3=C(BC)πs−1∑i=0(BC)iA(2i+2)d+C[r2]∑i=0(BC)(i+1)dA2iAπ. |
We can easily check that Corollary 3.4 extend both [26,Theorem 3.1] and [26,Theorem 3.3] as follows.
Corollary 3.6. Let N be a matrix of the form (1.3), where A and BC are square matrices of the same size such that ind(A)=r and ind(BC)=s.
(i) [26,Theorem 3.3] If ABC=0, then
Nd=[XAXBCXC[XAd+(BC)d(XA−Ad)]B]; |
(ii) [26,Theorem 3.1] If AB=0, then
Nd=[XA(BC)dBCX0], |
where
X=(BC)πs−1∑i=0(BC)iA(2i+2)d+[r2]∑i=0(BC)(i+1)dA2iAπ. | (3.3) |
Under new conditions, applying the formulae for the Drazin inverse of anti-triangular block matrices proved in Section 3, we present several representations for the Drazin inverse of a 2×2 block matrix M and generalize a series of results, most of whom are from the references.
Theorem 4.1. Let M be a matrix of the form (1.1) and N be a matrix of the form (1.3), where A, D and BC are square matrices such that A and BC are of the same size.If
A3BC=0,BCABC=0,BCA2BC=0,BDC=0andBD2=0, |
then
Md=[I00Dπ]s−1∑i=0[000D]iN(i+1)d+r−1∑i=0[000D(i+1)d]Ni[(BC)π−F1A−A2(BC)d−F1B−F3A−CA(BC)dI−F3B]+[I00Dπ]s−1∑i=0[000D]iN(i+2)d[000D]+r−2∑i=0[000D(i+3)d]Ni+1[0−F1BD0(I−F3B)D]−[000DdF4D+D2dCF2D], |
where Nd and Fn, n=¯1,4, are represented as in (3.1), ind(N)=r and ind(D)=s.
Proof. We can write M=N+Q, where
N=[ABC0]andQ=[000D]. |
Hence,
Qd=[000Dd]andQπ=[I00Dπ]. |
Using Theorem 3.3, Nd is represented as in (3.1) and so
Nπ=[I−F1A−F2C−F1B−F3A−F4CI−F3B]. |
From the equalities
F2C=A2(BC)d+(BC)dBC,F4C=CA(BC)d, |
we have
Nπ=[I−F1A−A2(BC)d−(BC)dBC−F1B−F3A−CA(BC)dI−F3B]. |
Because NQN=0 and NQ2=0, the rest is clear by Lemma 2.4.
In order to illustrate the width of Theorem 4.1, we only need to list the results generalized through whose following corollary.
Corollary 4.2. Let M be a matrix of the form (1.1) and N be a matrix of the form (1.3), where A, D and BC are square matrices such that A and BC are of the same size.If
A2BC=0,CABC=0,BDC=0andBD2=0, |
then
Md=[I00Dπ]s−1∑i=0[000D]iN(i+1)d+r−1∑i=0[000D(i+1)d]Ni[(BC)π−F1A−F1B−F3AI−F3B]+[I00Dπ]s−1∑i=0[000D]iN(i+2)d[000D]+r−2∑i=0[000D(i+3)d]Ni+1[0−F1BD0(I−F3B)D]−[000DdF4D+D2dCF2D], |
where Nd and Fn, n=¯1,4, are represented as in Corollary 3.4, ind(N)=r and ind(D)=s.
We can verify that Corollary 4.2 generalizes and unifies the following conditions about the expression for Md:
1. BC=0, BD=0 and DC=0 (see [12,Theorem 5.3]);
2. BC=0, BD=0 and D is nilpotent (see [14,Corollary 2.3]);
3. ABC=0,CBC=0 and BD=0 (see [17,Corollary 3.3]);
4. ABC=0 and BD=0 (see [18,Theorem 2.3] ).
In addition, we utilize Corollary 4.2 to obtain the following expression for Md as in [13,Corollary 2.3].
Corollary 4.3. [13,Corollary 2.3] Let M be a matrix of the form (1.1), where A, D and BC are square matrices such that A and BC are of the same size.If
BC=0,BDC=0andBD2=0, |
then
Md=[I00Dπ]s−1∑i=0[000D]i[AdA2dBCA2dCA3dB]i+1+r−1∑i=0[000D(i+1)d]Ni[Aπ−AdB−CAdI−CA2dB]+[I00Dπ]s−1∑i=0[000D]i[AdA2dBCA2dCA3dB]i+2[000D]+r−2∑i=0[000D(i+3)d]Ni+1[0−AdBD0(I−CA2dB)D]−[000DdCA3dBD+D2dCA2dBD], |
where ind(N)=r and ind(D)=s.
Utilizing Corollary 4.2, we also obtain the following expression for Md.
Corollary 4.4. Let M be a matrix of the form (1.1), where A, D and BC are square matrices such that A and BC are of the same size.If
A2B=0,CAB=0,BDC=0andBD2=0, |
then
Md=[I00Dπ]s−1∑i=0[000D]iN(i+1)d+r−1∑i=0[000D(i+1)d]Ni[(BC)π−F1A−F1B−F3AI−F3B]+[I00Dπ]s−1∑i=0[000D]iN(i+2)d[000D]+r−2∑i=0[000D(i+3)d]Ni+1[0−F1BD0(I−F3B)D]−[000D2dC(BC)dBD], |
where F1,F3 and Nd are given as in Corollary 3.5, ind(N)=r and ind(D)=s.
Utilizing Corollary 4.2, we obtain the expression for Md as in [16,Theorem 1].
Corollary 4.5. [16,Theorem 1] Let M be a matrix of the form (1.1), where A, D and BC are square matrices such that A and BC are of the same size.If
ABC=0,BD=0andDC=0, |
then
Md=[XAXBCXDd+C[XAd+(BC)d(XA−Ad)]B], |
where X is represented by (3.3).
We note that Corollary 4.5 generalizes the next formula proved in [15,Theorem 2.1].
Corollary 4.6. [15,Theorem 2.1] Let M be a matrix of the form (1.1), where A, D and BC are square matrices such that A and BC are of the same size.If
A=0andD=0, |
then
Md=[0(BC)dBC(BC)d0]. |
The following formula, which is a dual version of Theorem 4.1, can be proved similarly.
Theorem 4.7. Let M be a matrix of the form (1.1) and N be a matrix of the form (1.3), where A, D and BC are square matrices such that A and BC are of the same size.If
A3BC=0,BCABC=0,BCA2BC=0,DCA=0andDCB=0, |
then
Md=[(BC)π−F1A−A2(BC)d−F1B−F3A−CA(BC)dI−F3B]r−1∑i=0Ni[00D(i+2)dCD(i+1)d]+s−1∑i=0N(i+1)d[000D]i[I00Dπ]+s−2∑i=0N(i+3)d[00Di+1DπC0]−[F2DdC0F4DdC0]−N2d[00DDdC0], |
where Nd and Fn, n=¯1,4, are given by (3.1), ind(N)=r and ind(D)=s.
Proof. Notice that QNQ=0 and QN2=0, where Q and N are given as in the proof of Theorem 4.1. As in the proof of Theorem 4.1, this proof can be finished by using Theorem 3.3 and Lemma 2.4.
Applying Theorem 4.7, we prove the next formula for Md.
Corollary 4.8. Let M be a matrix of the form (1.1) and N be a matrix of the form (1.3), where A, D and BC are square matrices such that A and BC are of the same size.If
A2BC=0,CABC=0,DCA=0andDCB=0, |
then
Md=[−F1A+(BC)π−F1B−F3AI−F3B]r−1∑i=0Ni[00D(i+2)dCD(i+1)d]+s−1∑i=0N(i+1)d[000D]i[I00Dπ]+s−2∑i=0N(i+3)d[00Di+1DπC0]−[F2DdC0F4DdC0]−N2d[00DDdC0], |
where Nd and Fn, n=¯1,4, are given as in Corollary 3.4, ind(N)=r and ind(D)=s.
It is worth mentioning that Corollary 4.8 recovers the formulae for the Drazin inverse of M under the following assumptions:
1. ABC=0 and DC=0 (see [18,Theorem 2.2]);
2. ABC=0, DC=0 and BC is nilpotent (or D is nilpotent) (see [16,Theorem 2,Theorem 3]);
3. BC=0, DC=0 and D is nilpotent (see [14,Lemma 2.2] ).
In this section, we give an example to illustrate our results. Precisely, we present matrices N and M whose blocks are 4×4 complex matrices A, B, C and D which do not satisfy the conditions of [26,Theorem 3.1 and Theorem 3.3], [12,Theorem 5.3], [14,Corollary 2.3] and [18,Theorem 2.3], but the assumptions of Theorem 3.3 (or Corollary 3.4) and Theorem 4.1 (or Corollary 4.4) are met, which allows us to find Nd and Md.
Example 5.1. Let M be a matrix of the form (1.1) and N be a matrix of the form (1.3), where A, B, C and D are 4×4 complex matrices given by
A=[0000a0000b0000c0],B=[0000e0000f0000g0], |
C=[0000u0000v0000t0]andD=[000000000000ddd1], |
where 0∉{a,b,c,d,e,f,g,u,v,t}. Notice that
BC=[00000000fu0000gv00]≠0, |
AB=[00000000be0000cf00]≠0andABC=[000000000000cfu000]≠0. |
The conclusions above imply that [26,Theorem 3.1 and Theorem 3.3], [12,Theorem 5.3], [14,Corollary 2.3] and [18,Theorem 2.3] can not be applied. We note that the equalities A2BC=0, CABC=0 and BD=0 are satisfied, and utilize Theorem 3.3 (or Corollary 3.4) to obtain
Nd=[00000000a000e0000b000f0000c000g000000000u00000000v00000000t00000]d=0. |
Since D=D2=D#, we apply Theorem 4.1 (or Corollary 4.2) to get
Md=[00000000a000e0000b000f0000c000g000000000u00000000v00000000t0ddd1]d=[00000000000000000000000000000000000000000000000000000000d(u+va)+t(ba+fu)dv+tbt0d+(dv+tb)ed+tfd1]. |
The first author (D. Zhang) is supported by the National Natural Science Foundation of China (NSFC) (No. 11901079), China Postdoctoral Science Foundation (No. 2021M700751) and the Scientific and Technological Research Program Foundation of Jilin Province (No. JJKH20190690KJ; No. 20200401085GX; No. JJKH20220091KJ). The second author (D. Mosić) is supported by the Ministry of Education, Science and Technological Development, Republic of Serbia (No. 174007/451-03-9/2021-14/200124) and the bilateral project between Serbia and Slovenia (Generalized inverses, operator equations and applications, No. 337-00-21/2020-09/32).
The authors declare there is no conflicts of interest.
[1] |
C. D. Meyer, The role of the group generalized inverse in the theory of finite Markov chains, SIAM Review., 17 (1975), 443–464. https://doi.org/10.1137/1017044 doi: 10.1137/1017044
![]() |
[2] |
C. D. Meyer, The condition number of a finite Markov chains and perturbation bounds for the limitimg probabilities, SIAM J. Alg. Dis. Methods, 1 (1980), 273–283. https://doi.org/10.1137/0601031 doi: 10.1137/0601031
![]() |
[3] |
C. D. Meyer, R. J. Plemmons, Convergent powers of a matrix with applications to iterative methods for singular systems of linear systems, SIAM J. Numer. Anal., 14 (1977), 699–705. https://doi.org/10.1137/0714047 doi: 10.1137/0714047
![]() |
[4] |
Q. Xu, C. Song, L. He, Representations for the Drazin inverse of an anti-triangular block operator matrix E with ind(E)≤2, Linear Multilinear Algebra, 66 (2018), 1026–1045. https://doi.org/10.1080/03081087.2017.1335688 doi: 10.1080/03081087.2017.1335688
![]() |
[5] |
D. Zhang, D. Mosić, T. Tam, On the existence of group inverses of Peirce corner matrices, Linear Algebra Appl., 582 (2019), 482–498. https://doi.org/10.1016/j.laa.2019.07.033 doi: 10.1016/j.laa.2019.07.033
![]() |
[6] | S. L. Campbell, C. D. Meyer, Generalized inverses of linear Transformations, London, Pitman, 1979, Reprint, Dover, New York, 1991. |
[7] |
I. Kyrchei, Explicit formulas for determinantal representations of the Drazin inverse solutions of some matrix and differential matrix equations, Appl. Math. Comput., 219 (2013), 7632–7644. https://doi.org/10.1016/j.amc.2013.01.050 doi: 10.1016/j.amc.2013.01.050
![]() |
[8] |
I. Kyrchei, Determinantal representations of the Drazin inverse over the quaternion skew field with applications to some matrix equations, Appl. Math. Comput., 238 (2014), 193–207. https://doi.org/10.1016/j.amc.2014.03.125 doi: 10.1016/j.amc.2014.03.125
![]() |
[9] |
J. Rafael Sendra, J. Sendra, Symbolic computation of Drazin inverses by specializations, J. Comput. Anal. Appl., 301 (2016), 201–212. https://doi.org/10.1016/j.cam.2016.01.059 doi: 10.1016/j.cam.2016.01.059
![]() |
[10] |
P. S. Stanimirović, V. N. Katsikis, S. Srivastava, D. Pappas, A class of quadratically convergent iterative methods, RACSAM, 113 (2019), 3125–3146. https://doi.org/10.1007/s13398-019-00681-w doi: 10.1007/s13398-019-00681-w
![]() |
[11] |
P. S. Stanimirović, M. D. Petković, D. Gerontitis, Gradient neural network with nonlinear activation for computing inner inverses and the Drazin inverse, Neural Process Lett, 48 (2018), 109–133. https://doi.org/10.1007/s11063-017-9705-4 doi: 10.1007/s11063-017-9705-4
![]() |
[12] |
D. S. Djordjević, P. S. Stanimirović, On the generalized Drazin inverse and generalized resolvent, Czechoslovak Math. J., 51 (2001), 617–634. https://doi.org/10.1023/A:1013792207970 doi: 10.1023/A:1013792207970
![]() |
[13] | E. Dopazo, M. F. Martínez-Serrano, Further results on the representation of the Drazin inverse of a 2×2 block matrix, Linear Algebra Appl., 432 (2010), 1896–1904. |
[14] |
R. E. Hartwig, X. Li, Y. Wei, Representations for the Drazin inverse of a 2×2 block matrix, SIAM J. Matrix Anal. Appl., 27 (2006), 757–771. https://doi.org/10.1137/040606685 doi: 10.1137/040606685
![]() |
[15] |
M. Catral, D. D. Olesky, P. Van Den Driessche, Block representations of the Drazin inverse of a bipartite matrix, Electron. J. Linear Algebra, 18 (2009), 98–107. https://doi.org/10.13001/1081-3810.1297 doi: 10.13001/1081-3810.1297
![]() |
[16] |
A. S. Cvetković, G. V. Milovanović, On Drazin inverse of operator matrices, J. Math. Anal. Appl., 375 (2011), 331–335. https://doi.org/10.1016/j.jmaa.2010.08.080 doi: 10.1016/j.jmaa.2010.08.080
![]() |
[17] |
L. Guo, J. Chen, H. Zou, Representations for the Drazin inverse of the sum of two matrices and its applications, Bull. Iran. Math. Soc., 45 (2019), 683–699. https://doi.org/10.1007/s41980-018-0159-x doi: 10.1007/s41980-018-0159-x
![]() |
[18] |
C. Bu, K. Zhang, The explicit representations of the Drazin inverses of a class of block matrices, Electron. J. Linear Algebra, 20 (2010), 406–418. https://doi.org/10.13001/1081-3810.1384 doi: 10.13001/1081-3810.1384
![]() |
[19] |
C. Bu, C. Feng, S. Bai, Representations for the Drazin inverses of the sum of two matrices and some block matrices, Appl. Math. Comput., 218 (2012), 10226–10237. https://doi.org/10.1016/j.amc.2012.03.102 doi: 10.1016/j.amc.2012.03.102
![]() |
[20] |
C. Bu, J. Zhao, J. Tang, Representation of the Drazin inverse for special block matrix, Appl. Math. Comput., 217 (2011), 4935–4943. https://doi.org/10.1016/j.amc.2010.11.042 doi: 10.1016/j.amc.2010.11.042
![]() |
[21] |
N. Castro-González, E. Dopazo, Representations of the Drazin inverse for a class of block matrices, Linear Algebra Appl., 400 (2005), 253–269. https://doi.org/10.1016/j.laa.2004.12.027 doi: 10.1016/j.laa.2004.12.027
![]() |
[22] |
C. Deng, Generalized Drazin inverses of anti-triangular block matrices, J. Math. Anal. Appl., 368 (2010), 1–8. https://doi.org/10.1016/j.jmaa.2010.03.003 doi: 10.1016/j.jmaa.2010.03.003
![]() |
[23] |
E. Dopazo, M. F. Martínez-Serrano, J. Robles, Block representations for the Drazin inverse of anti-triangular matrices, Filomat, 30 (2016), 3897–3906. https://doi.org/10.2298/FIL1614897D doi: 10.2298/FIL1614897D
![]() |
[24] |
J. Huang, Y. Shi, A. Chen, The representation of the Drazin inverse of anti-triangular operator matrices based on resolvent expansions, Appl. Math. Comput., 242 (2014), 196–201. https://doi.org/10.1016/j.amc.2014.05.053 doi: 10.1016/j.amc.2014.05.053
![]() |
[25] |
X. Liu, H. Yang, Further results on the group inverses and Drazin inverses of anti-triangular block matrices, Appl. Math. Comput., 218 (2012), 8978–8986. https://doi.org/10.1016/j.amc.2012.02.058 doi: 10.1016/j.amc.2012.02.058
![]() |
[26] |
C. Deng, Y. Wei, A note on the Drazin inverse of an anti-triangular matrix, Linear Algebra Appl., 431 (2009), 1910–1922. https://doi.org/10.1016/j.laa.2009.06.030 doi: 10.1016/j.laa.2009.06.030
![]() |
[27] |
C. Bu, K. Zhang, J. Zhao, Representation of the Drazin inverse on solution of a class singular differential equations, Linear Multilinear Algebra, 59 (2011), 863–877. https://doi.org/10.1080/03081087.2010.512291 doi: 10.1080/03081087.2010.512291
![]() |
[28] | P. Patrício, R. E. Hartwig, The (2, 2, 0) Drazin inverse problem, Linear Algebra Appl., 437 (2012), 2755–2772. https://doi.org/10.1016/j.laa.2012.07.008 |
[29] |
D. Zhang, D. Mosić, Explicit formulae for the generalized Drazin inverse of block matrices over a Banach algebra, Filomat, 32 (2018), 5907–5917. https://doi.org/10.2298/FIL1817907Z doi: 10.2298/FIL1817907Z
![]() |
[30] | R. E. Cline, An application of representation for the generalized inverse of a matrix, MRC Technical Report 592, 1965. |
[31] |
R. E. Hartwig, J. M. Shoaf, Group inverses and Drazin inverses of bidiagonal and triangular Toeplitz matrices, J. Aust. Math. Soc., 24 (1977), 10–34. https://doi.org/10.1017/S1446788700020036 doi: 10.1017/S1446788700020036
![]() |
[32] |
C. D. Meyer, N. J. Rose, The index and the Drazin inverse of block triangular matrices, SIAM J. Appl. Math., 33 (1977), 1–7. https://doi.org/10.1137/0133001 doi: 10.1137/0133001
![]() |
[33] |
H. Yang, X. Liu, The Drazin inverse of the sum of two matrices and its applications, J. Comput. Appl. Math., 235 (2011), 1412–1417. https://doi.org/10.1016/j.cam.2010.08.027 doi: 10.1016/j.cam.2010.08.027
![]() |
1. | Huanyin Chen, Marjan Sheibani Abdolyousefi, The generalized Drazin inverse of an operator matrix with commuting entries, 2024, 31, 1072-947X, 195, 10.1515/gmj-2023-2074 | |
2. | Huanyin Chen, Marjan Sheibani, The Drazin inverse for perturbed block-operator matrices, 2024, 38, 0354-5180, 2311, 10.2298/FIL2407311C | |
3. | Huanyin Chen, Marjan Sheibani, g-Drazin inverse and group inverse for the anti-triangular block-operator matrices, 2024, 38, 0354-5180, 4973, 10.2298/FIL2414973C |