1.
Introduction
For convenience, the notations used in this paper are given in Table 1.
A lot of papers have been published for solving the Re-nnd and Re-pd solutions to some matrix equations. For example, the Re-nnd and Re-pd solutions to AX=C have been considered by Wu [1], Wu and Cain [2] and Groß [3]. The Re-nnd and Re-pd solutions to AXB=C have been discussed by Wang and Yang [4], Cvetković-Iliíc [5], Tian [6] and Yuan and Zuo [7]. The common Re-nnd and Re-pd solutions to AX=C and XB=D have been investigated by Liu [8] and Yuan et al., [9]. Although there are some results [10,11,12] concerning the Hermitian nonnegative definite and positive definite solutions of the following matrix equations
where A1∈Cm×n,A2∈Cp×n,C1∈Cm×m and C2∈Cp×p, the research results on the Re-nnd and Re-pd solutions to the Eq (1) are quite limited so far. Recently, determinantal representations of solutions and Hermitian solutions to Eq (1) have been considered by Kyrchei [13]. Song and Yu [14] studied the common Re-nnd and Re-pd solutions of (1) firstly by utilizing the maximal and minimal inertias of the linear Hermitian matrix function and the generalized inverses of matrices, and established some necessary and sufficient conditions for the existence of Re-nnd and Re-pd solutions of Eq (1).
The purpose of this paper is to provide an alternative approach to solve Eq (1). The necessary and sufficient conditions for the solvability along with the expressions for the Re-nnd and Re-pd solutions to the Eq (1) are presented with the help of the Moore-Penrose inverses and the spectral decompositions of matrices.
2.
Some lemmas
Some lemmas are needed in the following.
Lemma 1. [15,16] Let A1∈Cm×n,B1∈Cp×q, A2∈Cl×n,B2∈Cp×k and C1∈Cm×q,C2∈Cl×k. Then the pair of equations A1XB1=C1,A2XB2=C2 have a common solution X if and only if
where T=R(A∗1)∩R(A∗2), S=R(B1)∩R(B2). In this case, the general common solution to the equations can be expressed as
where
A=[A1A2],B=[B1,B2],Ψ=A†1A1FA2,Ξ=EB2B1B†1,D=A†2C2B†2−A†1C1B†1, and V1,V2,V3,V4 are arbitrary matrices.
Lemma 2. [17,18] Let B∈Cn×m,C∈Cp×n and A=A∗∈Cn×n. Then the matrix equation
has a solution X∈Cm×p if and only if
In this case, all the solutions X∈Cm×p satisfying Eq (2) are given by
where L=FCBB†, M∈Cm×p,SX∈Cn×n are arbitrary matrices with S∗X=−SX and Θ is given by Θ=12A(2In−BB†)+12(Φ−Φ∗)BB† with Φ=2L†FCA+(In−L†FC)AL†L.
Lemma 3. [19,20] Let A∈Cm×n and D∈Cm×n, and let the singular value decomposition of A be A=˜U[Σ000]˜V∗, where Σ=diag(σ1,...,σr)>0,r=rank(A), ˜U=[˜U1,˜U2]∈Cm×m,˜V=[˜V1,˜V2]∈Cn×n are unitary matrices with ˜U1∈Cm×r,˜V1∈Cn×r. Then:
(a) The matrix equation AY=D has a Hermitian nonnegative definite solution Y∈Cn×n if and only if DA∗≥0, R(D)=R(DA∗), in this case, the general Hermitian nonnegative definite solution is
where Y0=A†D+FA(A†D)∗+FAD∗(DA∗)†DFA, and H∈Cn×n is an arbitrary Hermitian nonnegative definite matrix.
(b) The matrix equation AY=D has a Hermitian positive definite solution Y∈Cn×n if and only if AA†D=D, ˜U∗1DA∗˜U1>0, in this case, the general Hermitian positive definite solution is
where Y0=A†D+FA(A†D)∗+FAD∗(DA∗)†DFA, and H∈Cn×n is an arbitrary Hermitian positive definite matrix.
3.
Re-nnd and Re-pd solutions to Eq (1)
In this section we propose a general theory elaborating how to solve the common Re-nnd and Re-pd solutions of Eq (1). From Lemma 1, Eq (1) has a common solution X∈Cn×n if and only if
where T=R(A∗1)∩R(A∗2). In this case, the general common solution of Eq (1) is
where X0 is a particular common solution of Eq (1), which is given by
A=[A1A2],Ψ=A†1A1FA2,D=A†2C2(A∗2)†−A†1C1(A∗1)†, and V1,V2,V3,V4 are arbitrary matrices. By Eq (5), we have
where V12=V1+V∗2,V34=V3+V∗4. Clearly, X is Re-nnd (Re-pd) if and only if H≥0 (H>0). By applying Lemma 2, we know that Eq (7) with respect to V12 is solvable if and only if
In this case, the general solution is
where M12∈Cn×n and S12∈Cn×n are arbitrary matrices with S∗12=−S12.
Notice that
Therefore,
which implies that
Namely, A†AFA1 and A†AFA2 are the orthogonal projectors (see [21,p.80,Ex.63]):
from which it is easily deduced that
From Lemma 2, Eq (8) with respect to V34 is solvable if and only if the following three equations hold simultaneously:
In the following, we will deduce the necessary and sufficient conditions on H≥0 (H>0) such that Eqs (12)–(14) are solvable. Let
Then, by using the relations of (10) and (11) we get
By (15), the Eq (14) can be equivalently written as
Now, let the spectral decomposition of A†A be
where a=rank(A†A)=rank(A) and U=[U1,U2] is a unitary matrix with U1∈Cn×a. It follows from (11), (16), (17) and (19) that
where P21=P1=P∗1,P22=P2=P∗2,P20=P0=P∗0 and P0P1=P1,P0P2=P2. By applying the relations of (19) and (22), Eq (18) can be further simplified as
where
From Lemma 3, Eq (23) has a Hermitian nonnegative definite solution H11∈Ca×a if and only if
in this case, by simple calculations, we can obtain the general Hermitian nonnegative definite solution of Eq (23) is
where D0=U∗1(X0+X∗0)U1 and
and K∈Ca×a is an arbitrary Hermitian nonnegative definite matrix.
Suppose that the spectral decomposition of Ia−P0 is
where g=rank(Ia−P0) and W=[W1,W2]∈Ca×a is a unitary matrix with W1∈Ca×g. From Lemma 3, Eq (23) has a Hermitian positive definite solution H11∈Ca×a if and only if
in this case, the general Hermitian positive definite solution is
where H110 is given by (27) and K∈Ca×a is an arbitrary Hermitian positive definite matrix.
By the ralations of (19)–(21) and (24), the Eqs (12) and (13) can be equivalently written as
Substituting (30) into (31) and (32), and noting that P0P1=P1=P1P0,P0P2=P2=P2P0, we obtain that
where
Direct verifications shows that P0−P1 and P0−P2 are orthogonal projectors. Hence, there exist unitary matrices G∈Ca×a and Q∈Ca×a such that
where e=rank(P0−P1),f=rank(P0−P2), and G1∈Ca×e,Q1∈Ca×f are column unitary matrices. By substituting the relations of (36) and (37) into (33) and (34), we arrive at the following equations:
Note that G1∈Ca×e and Q1∈Ca×f are column unitary matrices, it follows from [22] that the generalized singular value decomposition of the matrix pair [G1,Q1] is of the following form:
where M∈Ca×a is a nonsingular matrix and E∈Ce×e,F∈Cf×f are unitary matrices, and
k=rank([G1,Q1])=e+f−s, and
with
Substituting (39) into (38) and Partitioning M∗BM into the following form:
Then, by applying an established result in [9], we obtain
(a) Eq (38) has a common Hermitian nonnegative definite solution K if and only if
In this case, the general Hermitian nonnegative definite solution of (38) can be expressed as
where
with
and S∈Ck×(a−k) is an arbitrary matrix, T∈C(a−k)×(a−k) is an arbitrary Hermitian nonnegative definite matrix and N∈C(e−s)×(k−e) is an arbitrary contraction matrix (i.e., the largest singular value of the matrix N is not greater than 1).
(b) Eq (38) has a common Hermitian positive definite solution K if and only if
In this case, the general Hermitian positive definite solution of (38) can be expressed as
where F(K13) is defined by (42) with
and S∈Ck×(a−k) is an arbitrary matrix, T∈C(a−k)×(a−k) is an arbitrary Hermitian positive definite matrix and N∈C(e−s)×(k−e) is an arbitrary strict contraction matrix (i.e., the largest singular value of the matrix N is less than 1).
Once we achieve the Hermitian nonnegative definite (positive definite) solution K of Eq (38), the matrix H11 in (30) is completely specified. Also, when H11≥0, by (24) and Theorem 1 of [23], we can determine the expression of the matrix H≥0 by
and when H11>0, by (24) and Theorem 1 of [23], we can determine the expression of the matrix H>0 by
where E,H12,F and R are arbitrary matrices with F≥0 and R>0.
By using (19)–(21), the Eq (8) can be simplified as
where
When the conditions (12)–(14) hold, From Lemma 2, all the solutions V(34)11∈Ca×a satisfying Eq (48) are given by
where L=P1−P2P1, M34∈Ca×a,S34∈Ca×a are arbitrary matrices with S∗34=−S34 and Θ is given by
with
and H being given by (47).
In summary of the discussion above, we have proved the following results.
Theorem 1. For given matrices A1∈Cm×n,A2∈Cp×n,C1∈Cm×m and C2∈Cp×p, let A=[A1A2],Ψ=A†1A1FA2,D=A†2C2(A∗2)†−A†1C1(A∗1)†,T=R(A∗1)∩R(A∗2) and let X0,PT1,PS1 and PL be given by (6), (10) and (15), respectively. Suppose that the spectral decompositions of A†A,Ia−P0,P0−P1 and P0−P2 are respectively given by (19), (28), (36) and (37) with P1,P2 and P0 being given by (20)–(22). Let D0=U∗1(X0+X∗0)U1 and B be given by (35). Furthermore, assume that the generalized singular value decomposition of the matrix pair [G1,Q1] is given by (39), and the partition of the matrix M∗BM is given by (40). Then:
(a) The Eq (1) has a common Re-nnd solution if and only if
In this case, the general Re-nnd solution of (1) can be expressed as
where
V12,V(34)11 and H11 are respectively given by (9), (49) and (26) with K being given by (41), and V1,V3,V(34)12,V(34)21,V(34)22,E and F are arbitrary matrices with F≥0.
(b) The Eq (1) has a common Re-pd solution if and only if
In this case, the general Re-pd solution of (1) can be expressed as
where
V12,V(34)11 and H11 are respectively given by (9), (49) and (30) with K being given by (44), and V1,V3,V(34)12,V(34)21,V(34)22,H12 and R are arbitrary matrices with R>0.
4.
Numerical algorithm and numerical examples
According to Theorem 1, we can describe a numerical algorithm to solve Eq (1).
Algorithm 1.
1). Input A1,A2,C1,C2.
2). If the conditions (4) are satisfied, go to 3; otherwise, Eq (1) has no solution, and stop.
3). Compute X0 by (6).
4). Compute PT1,PS1 and PL by (10) and (15).
5). Compute the spectral decomposition of the matrix A†A by (19).
6). Compute P1,P2,P0 by (20)−(22), respectively.
7). Compute the spectral decomposition of the matrix Ia−P0 by (28).
8).(a) If the conditions (25) are satisfied, go to 9; otherwise, Eq (1) has no Re-nnd solutions, and stop. (b) If the condition (29) is satisfied, go to 9; otherwise, Eq (1) has no Re-pd solutions, and stop.
9). Compute B by (35).
10). Compute the spectral decomposition of the matrices P0−P1,P0−P2 by (36) and (37), respectively.
11). Compute Bij,i,j=1,2,3,4 by (40).
12).(a) If the conditions (50) are satisfied, go to 13; otherwise, Eq (1) has no Re-nnd solutions, and stop. (b) If the conditions (52) are satisfied, go to 13; otherwise, Eq (1) has no Re-pd solutions, and stop.
13). Choosee matrices M12,S12 and M34,S34, and compute V12 and V(34)11 by (9) and (49), respectively.
14).(a) Choose matrix S, Hermitian nonnegative definite matrix T and contraction matrix N, and compute H11, K by (26) and (41), respectively.
(b) Choose matrix S, Hermitian positive definite
matrix T and strict contraction matrix N, and compute H11, K by (30) and (44), respectively.
15).(a) Choose matrices V1,V3,V(34)12,V(34)21,V(34)22,E and F, and compute Re-nnd solutions by (51).
(b) Choose matrices V1,V3,V(34)12,V(34)21,V(34)22,H12 and R, and compute Re-pd solutions by (53).
Example 1. Let m=8,n=7,p=6, and the matrices A1,A2,C1,C2 be given by
It is easy to verify that the conditions (4),(25) and (50) hold. According to Algorithm 1, by choosing matrices M12=0,S12=0,M34=0,S34=0,S=0,V1=0,V3=0,N=I3 and T=diag(1,1,0). We can obtain a Re-nnd solution X of Eq (1) as follows:
The absolute errors are estimated by
and the eigenvalues of 12(X+X∗) are (0.0000,0.1176,0.3090,0.7064,0.9076,1.3411,13.8617), which implies that X is a Re-nnd matrix.
Example 2. Let m=8,n=7,p=6, and the matrices A1,A2 be given as in Example 1, and C1,C2 be given by
It is easy to verify that the conditions (4),(29),(52) hold. According to Algorithm 1, by choosing matrices M12=0,S12=0,M34=0,S34=0,S=0,V1=0,V3=0,T=I3 and N=diag(0.5,0.9). We can obtain a Re-pd solution X of Eq (1) as follows:
The absolute errors are estimated by
and the eigenvalues of 12(X+X∗) are (0.1237,0.2834,0.7033,0.8109,1.0267,1.4143,13.9510), which implies that X is a Re-pd matrix.
5.
Conclusions
In the previous sections, we studied the common Re-nonnegative definite and Re-positive definite solutions of linear matrix equations (1). We established a set of necessary and sufficient conditions for the existence of a general common Re-nonnegative definite solution, Re-positive definite solution of (1) respectively. Moreover, we gave the explicit expressions for these general common solutions when the consistent conditions are satisfied. At the end, we showed an algorithm and two examples to illustrate the main results of this paper.