Research article

The common Re-nonnegative definite and Re-positive definite solutions to the matrix equations A1XA1=C1 and A2XA2=C2

  • Received: 20 August 2021 Accepted: 06 October 2021 Published: 13 October 2021
  • MSC : 15A24, 15A57

  • In this paper, we consider the common Re-nonnegative definite (Re-nnd) and Re-positive definite (Re-pd) solutions to a pair of linear matrix equations A1XA1=C1, A2XA2=C2 and present some necessary and sufficient conditions for their solvability as well as the explicit expressions for the general common Re-nnd and Re-pd solutions when the consistent conditions are satisfied.

    Citation: Yinlan Chen, Lina Liu. The common Re-nonnegative definite and Re-positive definite solutions to the matrix equations A1XA1=C1 and A2XA2=C2[J]. AIMS Mathematics, 2022, 7(1): 384-397. doi: 10.3934/math.2022026

    Related Papers:

    [1] Jiao Xu, Hairui Zhang, Lina Liu, Huiting Zhang, Yongxin Yuan . A unified treatment for the restricted solutions of the matrix equation $AXB=C$. AIMS Mathematics, 2020, 5(6): 6594-6608. doi: 10.3934/math.2020424
    [2] Qi Xiao, Jin Zhong . Characterizations and properties of hyper-dual Moore-Penrose generalized inverse. AIMS Mathematics, 2024, 9(12): 35125-35150. doi: 10.3934/math.20241670
    [3] Changzhou Li, Chao Yuan, Shiliang Chen . On positive definite solutions of the matrix equation $ X-\sum_{i = 1}^{m}A_{i}^{\ast}X^{-p_{i}}A_{i} = Q $. AIMS Mathematics, 2024, 9(9): 25532-25544. doi: 10.3934/math.20241247
    [4] Yang Chen, Kezheng Zuo, Zhimei Fu . New characterizations of the generalized Moore-Penrose inverse of matrices. AIMS Mathematics, 2022, 7(3): 4359-4375. doi: 10.3934/math.2022242
    [5] Yajun Xie, Changfeng Ma, Qingqing Zheng . On the nonlinear matrix equation $ X^{s}+A^{H}F(X)A = Q $. AIMS Mathematics, 2023, 8(8): 18392-18407. doi: 10.3934/math.2023935
    [6] Pattrawut Chansangiam, Arnon Ploymukda . Riccati equation and metric geometric means of positive semidefinite matrices involving semi-tensor products. AIMS Mathematics, 2023, 8(10): 23519-23533. doi: 10.3934/math.20231195
    [7] Mahmoud S. Mehany, Faizah D. Alanazi . An $ \eta $-Hermitian solution to a two-sided matrix equation and a system of matrix equations over the skew-field of quaternions. AIMS Mathematics, 2025, 10(4): 7684-7705. doi: 10.3934/math.2025352
    [8] Sourav Shil, Hemant Kumar Nashine . Positive definite solution of non-linear matrix equations through fixed point technique. AIMS Mathematics, 2022, 7(4): 6259-6281. doi: 10.3934/math.2022348
    [9] Muhammad Tariq, Eskandar Ameer, Amjad Ali, Hasanen A. Hammad, Fahd Jarad . Applying fixed point techniques for obtaining a positive definite solution to nonlinear matrix equations. AIMS Mathematics, 2023, 8(2): 3842-3859. doi: 10.3934/math.2023191
    [10] Yuxue Wang, Songyu Bai . Pipe roughness calibration in oil field water injection system. AIMS Mathematics, 2025, 10(3): 5052-5070. doi: 10.3934/math.2025231
  • In this paper, we consider the common Re-nonnegative definite (Re-nnd) and Re-positive definite (Re-pd) solutions to a pair of linear matrix equations A1XA1=C1, A2XA2=C2 and present some necessary and sufficient conditions for their solvability as well as the explicit expressions for the general common Re-nnd and Re-pd solutions when the consistent conditions are satisfied.



    For convenience, the notations used in this paper are given in Table 1.

    Table 1.  Table of notations.
    Notations Meaning
    A Moore-Penrose inverse of the matrix A
    A conjugate transpose of the matrix A
    A0 A is Hermitian nonnegative definite
    A>0 A is Hermitian positive definite
    12(A+A)0 A is Re-nonnegative definite (Re-nnd)
    12(A+A)>0 A is Re-positive definite (Re-pd)
    Cm×n set of all m×n complex matrices
    PL orthogonal projector on the subspace L
    R(A) range space of the complex matrix A
    N(A) null space of the complex matrix A
    In n×n identity matrix
    EA =ImAA,  ACm×n
    FA =InAA,  ACm×n

     | Show Table
    DownLoad: CSV

    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

    A1XA1=C1,  A2XA2=C2, (1)

    where A1Cm×n,A2Cp×n,C1Cm×m and C2Cp×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.

    Some lemmas are needed in the following.

    Lemma 1. [15,16] Let A1Cm×n,B1Cp×q, A2Cl×n,B2Cp×k and C1Cm×q,C2Cl×k. Then the pair of equations A1XB1=C1,A2XB2=C2 have a common solution X if and only if

    A1A1C1B1B1=C1,  A2A2C2B2B2=C2,  PT(A1C1B1A2C2B2)PS=0,

    where T=R(A1)R(A2), S=R(B1)R(B2). In this case, the general common solution to the equations can be expressed as

    X=X0+FAV1+V2EB+FA1V3EB2+FA2V4EB1,

    where

    X0=A2C2B2FA2ΨA1A1DEΨA1A1DB1B1ΞEB2,

    A=[A1A2],B=[B1,B2],Ψ=A1A1FA2,Ξ=EB2B1B1,D=A2C2B2A1C1B1, and V1,V2,V3,V4 are arbitrary matrices.

    Lemma 2. [17,18] Let BCn×m,CCp×n and A=ACn×n. Then the matrix equation

    BXC+(BXC)=A, (2)

    has a solution XCm×p if and only if

    EBAEB=0,  FCAFC=0,  [B,C][B,C]A=A. (3)

    In this case, all the solutions XCm×p satisfying Eq (2) are given by

    X=B(Θ+FLSXFLBB)C+MBBMCC,

    where L=FCBB, MCm×p,SXCn×n are arbitrary matrices with SX=SX and Θ is given by Θ=12A(2InBB)+12(ΦΦ)BB with Φ=2LFCA+(InLFC)ALL.

    Lemma 3. [19,20] Let ACm×n and DCm×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 ˜U1Cm×r,˜V1Cn×r. Then:

    (a) The matrix equation AY=D has a Hermitian nonnegative definite solution YCn×n if and only if DA0, R(D)=R(DA), in this case, the general Hermitian nonnegative definite solution is

    Y=Y0+FAHFA,

    where Y0=AD+FA(AD)+FAD(DA)DFA, and HCn×n is an arbitrary Hermitian nonnegative definite matrix.

    (b) The matrix equation AY=D has a Hermitian positive definite solution YCn×n if and only if AAD=D, ˜U1DA˜U1>0, in this case, the general Hermitian positive definite solution is

    Y=Y0+FAHFA,

    where Y0=AD+FA(AD)+FAD(DA)DFA, and HCn×n is an arbitrary Hermitian positive definite matrix.

    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 XCn×n if and only if

    A1A1C1A1A1=C1,  A2A2C2A2A2=C2,  PT(A1C1(A1)A2C2(A2))PT=0, (4)

    where T=R(A1)R(A2). In this case, the general common solution of Eq (1) is

    X=X0+FAV1+V2FA+FA1V3FA2+FA2V4FA1, (5)

    where X0 is a particular common solution of Eq (1), which is given by

    X0=A2C2(A2)FA2ΨA1A1DEΨA1A1DA1A1(Ψ)FA2, (6)

    A=[A1A2],Ψ=A1A1FA2,D=A2C2(A2)A1C1(A1), and V1,V2,V3,V4 are arbitrary matrices. By Eq (5), we have

    X+X=X0+X0+FAV12+V12FA+FA1V34FA2+FA2V34FA1H, (7)

    where V12=V1+V2,V34=V3+V4. Clearly, X is Re-nnd (Re-pd) if and only if H0 (H>0). By applying Lemma 2, we know that Eq (7) with respect to V12 is solvable if and only if

    AAFA1V34FA2AA+AAFA2V34FA1AA=AA(HX0X0)AA. (8)

    In this case, the general solution is

    V12=12FA(HX0X0FA1V34FA2FA2V34FA1)(In+AA)+FAS12FA+AAM12, (9)

    where M12Cn×n and S12Cn×n are arbitrary matrices with S12=S12.

    Notice that

    R(FA)=R(InAA)=N(AA)=N(A)=N(A1)N(A2),R(FA1)=N(A1), R(FA2)=N(A2).

    Therefore,

    FA1FA=FA=FAFA1, FA2FA=FA=FAFA2,AAFA1=(InFA)FA1=FA1FA, AAFA2=(InFA)FA2=FA2FA,

    which implies that

    AAFA1=FA1AA, AAFA2=FA2AA,(FA1FA)2=FA1FA, (FA2FA)2=FA2FA.

    Namely, AAFA1 and AAFA2 are the orthogonal projectors (see [21,p.80,Ex.63]):

    AAFA1=PR(A)N(A1)PT1, AAFA2=PR(A)N(A2)PS1, (10)

    from which it is easily deduced that

    AAPT1=PT1=PT1AA, AAPS1=PS1=PS1AA. (11)

    From Lemma 2, Eq (8) with respect to V34 is solvable if and only if the following three equations hold simultaneously:

    (InPT1)AAHAA(InPT1)=(InPT1)AA(X0+X0)AA(InPT1), (12)
    (InPS1)AAHAA(InPS1)=(InPS1)AA(X0+X0)AA(InPS1), (13)
    [PT1,PS1][PT1,PS1]AA(HX0X0)AA=AA(HX0X0)AA. (14)

    In the following, we will deduce the necessary and sufficient conditions on H0 (H>0) such that Eqs (12)–(14) are solvable. Let

    [PT1,PS1][PT1,PS1]=PT1+S1PL. (15)

    Then, by using the relations of (10) and (11) we get

    AAPL=PL=PLAA, (16)
    PLPT1=PT1=PT1PL, PLPS1=PS1=PS1PL. (17)

    By (15), the Eq (14) can be equivalently written as

    (InPL)AAHAA=(InPL)AA(X0+X0)AA. (18)

    Now, let the spectral decomposition of AA be

    AA=U[Ia000]U=U1U1, (19)

    where a=rank(AA)=rank(A) and U=[U1,U2] is a unitary matrix with U1Cn×a. It follows from (11), (16), (17) and (19) that

    PT1=U[P1000]U, (20)
    PS1=U[P2000]U, (21)
    PL=U[P0000]U, (22)

    where P21=P1=P1,P22=P2=P2,P20=P0=P0 and P0P1=P1,P0P2=P2. By applying the relations of (19) and (22), Eq (18) can be further simplified as

    (IaP0)H11=(IaP0)U1(X0+X0)U1, (23)

    where

    UHU=[H11H12H12H22]. (24)

    From Lemma 3, Eq (23) has a Hermitian nonnegative definite solution H11Ca×a if and only if

    (IaP0)U1(X0+X0)U1(IaP0)0,R((IaP0)U1(X0+X0)U1)=R((IaP0)U1(X0+X0)U1(IaP0)), (25)

    in this case, by simple calculations, we can obtain the general Hermitian nonnegative definite solution of Eq (23) is

    H11=H110+P0KP0, (26)

    where D0=U1(X0+X0)U1 and

    H110=D0P0D0P0+P0D0(IaP0)[(IaP0)D0(IaP0)](IaP0)D0P0, (27)

    and KCa×a is an arbitrary Hermitian nonnegative definite matrix.

    Suppose that the spectral decomposition of IaP0 is

    IaP0=W[Ig000]W=W1W1, (28)

    where g=rank(IaP0) and W=[W1,W2]Ca×a is a unitary matrix with W1Ca×g. From Lemma 3, Eq (23) has a Hermitian positive definite solution H11Ca×a if and only if

    W1U1(X0+X0)U1W1>0, (29)

    in this case, the general Hermitian positive definite solution is

    H11=H110+P0KP0, (30)

    where H110 is given by (27) and KCa×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

    (IaP1)H11(IaP1)=(IaP1)U1(X0+X0)U1(IaP1), (31)
    (IaP2)H11(IaP2)=(IaP2)U1(X0+X0)U1(IaP2). (32)

    Substituting (30) into (31) and (32), and noting that P0P1=P1=P1P0,P0P2=P2=P2P0, we obtain that

    (P0P1)K(P0P1)=(P0P1)B(P0P1), (33)
    (P0P2)K(P0P2)=(P0P2)B(P0P2), (34)

    where

    B=D0D0(IaP0)[(IaP0)D0(IaP0)](IaP0)D0. (35)

    Direct verifications shows that P0P1 and P0P2 are orthogonal projectors. Hence, there exist unitary matrices GCa×a and QCa×a such that

    P0P1=G[Ie000]G=G1G1, (36)
    P0P2=Q[If000]Q=Q1Q1, (37)

    where e=rank(P0P1),f=rank(P0P2), and G1Ca×e,Q1Ca×f are column unitary matrices. By substituting the relations of (36) and (37) into (33) and (34), we arrive at the following equations:

    G1KG1=G1BG1,  Q1KQ1=Q1BQ1. (38)

    Note that G1Ca×e and Q1Ca×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:

    G1=MΣ1E,   Q1=MΣ2F, (39)

    where MCa×a is a nonsingular matrix and ECe×e,FCf×f are unitary matrices, and

    Σ1=[I00Γ0000]esskeak    ess,  Σ2=[00Δ00I00]esskeak            sfs,

    k=rank([G1,Q1])=e+fs, and

    Γ=diag(γ1,,γs),  Δ=diag(δ1,,δs)

    with

    1>γ1γs>0,  0<δ1δs<1, γ2i+δ2i=1, i=1,,s.

    Substituting (39) into (38) and Partitioning MBM into the following form:

    MBM=[B11B12B13B14B12B22B23B24B13B23B33B34B14B24B34B44]esskeak                es s  keak. (40)

    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

    [B11B12B12B22]0,  [B22B23B23B33]0.

    In this case, the general Hermitian nonnegative definite solution of (38) can be expressed as

    K=(M)1[F(K13)F(K13)SSF(K13)T+SF(K13)S]M1, (41)

    where

    F(K13)[B11B12K13B12B22B23K13B23B33], (42)

    with

    K13=B12B22B23+(B11B12B22B12)12N(B33B23B22B23)12, (43)

    and SCk×(ak) is an arbitrary matrix, TC(ak)×(ak) is an arbitrary Hermitian nonnegative definite matrix and NC(es)×(ke) 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

    [B11B12B12B22]>0,  [B22B23B23B33]>0.

    In this case, the general Hermitian positive definite solution of (38) can be expressed as

    K=(M)1[F(K13)SST+S(F(K13))1S]M1, (44)

    where F(K13) is defined by (42) with

    K13=B12B122B23+(B11B12B122B12)12N(B33B23B122B23)12, (45)

    and SCk×(ak) is an arbitrary matrix, TC(ak)×(ak) is an arbitrary Hermitian positive definite matrix and NC(es)×(ke) 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 H110, by (24) and Theorem 1 of [23], we can determine the expression of the matrix H0 by

    H=U[H11H11EEH11EH11E+F]U, (46)

    and when H11>0, by (24) and Theorem 1 of [23], we can determine the expression of the matrix H>0 by

    H=U[H11H12H12H12H111H12+R]U, (47)

    where E,H12,F and R are arbitrary matrices with F0 and R>0.

    By using (19)–(21), the Eq (8) can be simplified as

    P1V(34)11P2+P2(V(34)11)P1=U1(HX0X0)U1, (48)

    where

    UV34U=[V(34)11V(34)12V(34)21V(34)22].

    When the conditions (12)–(14) hold, From Lemma 2, all the solutions V(34)11Ca×a satisfying Eq (48) are given by

    V(34)11=P1[Θ+FLS34FLP1]P2+M34P1M34P2, (49)

    where L=P1P2P1, M34Ca×a,S34Ca×a are arbitrary matrices with S34=S34 and Θ is given by

    Θ=12U1(HX0X0)U1(2IaP1)+12(ΦΦ)P1,

    with

    Φ=2L(IaP2)U1(HX0X0)U1+(InL(IaP2))U1(HX0X0)U1LL,

    and H being given by (47).

    In summary of the discussion above, we have proved the following results.

    Theorem 1. For given matrices A1Cm×n,A2Cp×n,C1Cm×m and C2Cp×p, let A=[A1A2],Ψ=A1A1FA2,D=A2C2(A2)A1C1(A1),T=R(A1)R(A2) and let X0,PT1,PS1 and PL be given by (6), (10) and (15), respectively. Suppose that the spectral decompositions of AA,IaP0,P0P1 and P0P2 are respectively given by (19), (28), (36) and (37) with P1,P2 and P0 being given by (20)(22). Let D0=U1(X0+X0)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 MBM is given by (40). Then:

    (a) The Eq (1) has a common Re-nnd solution if and only if

    A1A1C1A1A1=C1,  A2A2C2A2A2=C2,  PT(A1C1(A1)A2C2(A2))PT=0, (4)
    (IaP0)U1(X0+X0)U1(IaP0)0,R((IaP0)U1(X0+X0)U1)=R((IaP0)U1(X0+X0)U1(IaP0)), (25)
    [B11B12B12B22]0,  [B22B23B23B33]0. (50)

    In this case, the general Re-nnd solution of (1) can be expressed as

    X=X0+FAV1+(V12V1)FA+FA1V3FA2+FA2(V34V3)FA1, (51)

    where

    H=U[H11H11EEH11EH11E+F]U,V34=U[V(34)11V(34)12V(34)21V(34)22]U,

    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 F0.

    (b) The Eq (1) has a common Re-pd solution if and only if

    A1A1C1A1A1=C1,  A2A2C2A2A2=C2,  PT(A1C1(A1)A2C2(A2))PT=0, (4)
    W1U1(X0+X0)U1W1>0, (29)
    [B11B12B12B22]>0,  [B22B23B23B33]>0. (52)

    In this case, the general Re-pd solution of (1) can be expressed as

    X=X0+FAV1+(V12V1)FA+FA1V3FA2+FA2(V34V3)FA1, (53)

    where

    H=U[H11H12H12H12H111H12+R]U,V34=U[V(34)11V(34)12V(34)21V(34)22]U,

    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.

    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 AA by (19).

    6). Compute P1,P2,P0 by (20)(22), respectively.

    7). Compute the spectral decomposition of the matrix IaP0 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 P0P1,P0P2 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

    A1=[0.15050.37840.55940.19390.26600.40280.27900.26720.08190.27310.28760.33020.42360.22380.34060.10900.05220.54360.19260.58600.10380.19860.12800.01970.40280.32720.34000.10710.15300.13610.30860.10800.19660.53780.01970.15950.32740.89080.00560.03081.13750.08230.23000.04460.52360.23630.54480.27710.30150.22820.24260.49560.37620.01490.06860.1080],A2=[0.34370.18680.04630.16600.66760.18410.05780.57800.26120.09100.68170.65220.21670.36380.04331.07680.61680.60390.49630.10740.02720.05460.22990.53150.12990.45680.27440.20750.18460.15160.52930.17250.33280.21600.22130.30500.15420.19670.43810.71810.51320.2174],C1=[1.61940.40171.11721.04610.13901.93580.14690.02510.39750.86970.23670.16550.48000.34110.14070.32101.12130.23850.82580.69430.07111.38940.12500.06881.04720.16800.69231.20750.32251.43120.54190.18330.13580.47780.07200.32120.44470.25840.36880.29691.94150.33541.38611.43310.25713.20190.15180.34290.14770.13690.12910.54330.36540.15820.54330.20550.02560.32220.07020.18280.29810.34530.20570.2709],C2=[1.34780.52740.98190.27930.46140.96700.52631.88460.38730.63850.60560.66160.98190.38802.29900.12730.24242.04670.27980.63960.12760.81070.60860.29110.46250.60310.24180.61070.55540.10270.96840.66632.04590.28780.10402.0062].

    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:

    X=[2.72942.21452.04162.18061.40822.11961.35772.27623.33392.25002.27242.01742.89621.87252.06562.03142.00391.76331.40751.61551.54882.15322.49691.76262.31811.29992.21861.55951.36592.00561.25731.45362.14371.93641.25122.12642.87591.63202.20221.95142.90111.57241.29362.17061.42471.68301.03761.56381.8132].

    The absolute errors are estimated by

    A1XA1C1=1.2097×1014, A2XA2C2=1.4756×1014,

    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

    C1=[1.72420.41441.07921.09280.15922.03750.10910.07360.37750.87200.23380.14080.49080.37240.16040.30411.11860.22010.88530.69670.04911.42320.14480.06301.07140.15150.69331.23300.30251.48130.51530.19070.14160.49720.04880.30120.47740.28400.38800.25962.08150.33341.36531.51660.25783.36750.08930.37460.13440.14890.14760.51590.38700.12970.58480.17960.12060.27660.01620.16110.23840.39140.21310.3403],C2=[1.39010.57250.75670.23030.48630.93100.59292.00410.77760.56340.66840.72560.88420.56593.15180.01640.06832.13860.22800.56270.03640.86190.59750.26040.43750.59730.13060.60400.61280.12640.92510.71742.25100.26160.08632.0681].

    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:

    X=[2.66832.02182.04222.17991.39332.10781.32432.36753.97412.21752.22372.01402.86191.90351.96662.10382.08691.69261.31931.65331.45782.15072.37741.71002.46281.40432.19401.60271.34132.03091.24861.49662.15481.92871.21832.11272.84831.66372.18311.93843.00001.56651.21642.03571.35821.71931.12331.57301.9679].

    The absolute errors are estimated by

    A1XA1C1=1.4493×1014, A2XA2C2=1.5563×1014,

    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.

    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.



    [1] L. Wu, The Re-positive definite solutions to the matrix inverse problem AX=B, Linear Algebra Appl., 174 (1992), 145–151. doi: 10.1016/0024-3795(92)90048-F. doi: 10.1016/0024-3795(92)90048-F
    [2] L. Wu, B. Cain, The Re-nonnegative definite solutions to the matrix inverse problem AX=B, Linear Algebra Appl., 236 (1996), 137–146. doi: 10.1016/0024-3795(94)00142-1. doi: 10.1016/0024-3795(94)00142-1
    [3] J. Groß, Explicit solutions to the matrix inverse problem AX=B, Linear Algebra Appl., 289 (1999), 131–134. doi: 10.1016/S0024-3795(97)10008-8. doi: 10.1016/S0024-3795(97)10008-8
    [4] Q. W. Wang, C. L. Yang, The Re-nonnegative definite solutions to the matrix equation AXB=C, Comment. Math. Univ. Ca., 39 (1998), 7–13.
    [5] D. S. Cvetković-Iliíc, Re-nnd solutions of the matrix equation AXB=C, J. Aust. Math. Soc., 84 (2008), 63–72. doi: doi:10.1017/S1446788708000207.
    [6] Y. G. Tian, Maximization and minimization of the rank and inertia of the Hermitian matrix expression ABX(BX) with applications, Linear Algebra Appl., 434 (2011), 2109–2139. doi: 10.1016/j.laa.2010.12.010. doi: 10.1016/j.laa.2010.12.010
    [7] Y. X. Yuan, K. Z. Zuo, The Re-nonnegative definite and Re-positive definite solutions to the matrix equation AXB=D, Appl. Math. Comput., 256 (2015), 905–912. doi: 10.1016/j.amc.2015.01.098. doi: 10.1016/j.amc.2015.01.098
    [8] X. F. Liu, Comments on "The common Re-nnd and Re-pd solutions to the matrix equations AX=C and XB=D", Appl. Math. Comput., 236 (2014), 663–668. doi: 10.1016/j.amc.2014.03.074. doi: 10.1016/j.amc.2014.03.074
    [9] Y. X. Yuan, H. T. Zhang, L. Liu, The Re-nnd and Re-pd solutions to the matrix equations AX=C, XB=D, Linear and Multilinear Algebra, 69 (2021), 1645–1656. doi: 10.1080/03081087.2020.1845596. doi: 10.1080/03081087.2020.1845596
    [10] X. Zhang, The general common Hermitian nonnegative-definite solution to the matrix equations AXA=B and CXC=D, Linear Multilinear A., 52 (2004), 49–60. doi: 10.1080/0308108031000122498. doi: 10.1080/0308108031000122498
    [11] X. Zhang, M. Y. Cheng, The general common nonnegative definite and positive definite solutions to the matrix equations AXA=BB and CXC=DD, Appl. Math. Lett., 17 (2004), 543–547. doi: 10.1016/S0893-9659(04)90123-1. doi: 10.1016/S0893-9659(04)90123-1
    [12] X. Zhang, The general common Hermitian nonnegative-definite solution to the matrix equations AXA=BB and CXC=DD with applications in statistics, J. Multivariate Anal., 93 (2005), 257–266. doi: 10.1016/j.jmva.2004.04.009. doi: 10.1016/j.jmva.2004.04.009
    [13] I. I. Kyrchei, Determinantal representations of solutions and Hermitian solutions to some system of two-sided quaternion matrix equations. J. Math., 2018, (2018), 6294672. doi: 10.1155/2018/6294672.
    [14] G. J. Song, S. W. Yu, Nonnegative definite and Re-nonnegative definite solutions to a system of matrix equations with statistical applications, AppL. Math. Comput., 338 (2018), 828–841. doi: 10.1016/j.amc.2018.06.045. doi: 10.1016/j.amc.2018.06.045
    [15] H. T. Zhang, H. R. Zhang, L. Liu, Y. X. Yuan, A simple method for solving matrix equations AXB=D and GXH=C, AIMS Mathematics, 6 (2021), 2579–2589. doi: 10.3934/math.2021156. doi: 10.3934/math.2021156
    [16] Y. G. Tian, The solvability of two linear matrix equations, Linear Multilinear A., 48 (2000), 123–147. doi: 10.1080/03081080008818664. doi: 10.1080/03081080008818664
    [17] K. Yasuda, R. E. Skelton, Assigning controllability and observability Gramians in feedback control, JGCD, 14 (1991), 878–885. doi: 10.2514/3.20727. doi: 10.2514/3.20727
    [18] Y. H. Liu, Y. G. Tian, Max-min problems on the ranks and inertias of the matrix expressions ABXC±(BXC) with applications, J. Optim. Theory Appl., 148 (2011), 593–622. doi: 10.1007/s10957-010-9760-8. doi: 10.1007/s10957-010-9760-8
    [19] L. Zhang, The solvability conditions for the inverse problem of symmetric nonnegative definite matrices, Math. Numer. Sinica, 11 (1989), 337–343.
    [20] H. Dai, The stability of solutions for two classes of inverse problems of matrices, Numerical Mathematics–A Journal of Chinese Universities, 16 (1994), 87–96.
    [21] A. Ben-Israel, T. N. E. Greville, Generalized inverses: Theory and applications New York: Springer, 2003.
    [22] C. C. Paige, M. A. Saunders, Towards a generalized singular value decompostion, SIAM J. Numer. Anal., 18 (1981), 398–405. doi: 10.1137/0718026. doi: 10.1137/0718026
    [23] A. Albert, Condition for positive and nonnegative definite in terms of pseudoinverse, SIAM J. Appl. Math., 17 (1969), 434–440. doi: 10.1137/0117041. doi: 10.1137/0117041
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2625) PDF downloads(60) Cited by(0)

Figures and Tables

Tables(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog