AAA Abstract and Applied Analysis 1687-0409 1085-3375 Hindawi Publishing Corporation 124979 10.1155/2013/124979 124979 Research Article Iterative Solution to a System of Matrix Equations Lin Yong 1,2 http://orcid.org/0000-0002-0494-4928 Wang Qing-Wen 1 Hajarian Masoud 1 Department of Mathematics Shanghai University Shanghai 200444 China shu.edu.cn 2 School of Mathematics and Statistics Suzhou University Suzhou 234000 China suda.edu.cn 2013 24 10 2013 2013 17 05 2013 21 09 2013 2013 Copyright © 2013 Yong Lin and Qing-Wen Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

An efficient iterative algorithm is presented to solve a system of linear matrix equations A1X1B1+A2X2B2=E, C1X1D1+C2X2D2=F with real matrices X1 and X2. By this iterative algorithm, the solvability of the system can be determined automatically. When the system is consistent, for any initial matrices X10 and X20, a solution can be obtained in the absence of roundoff errors, and the least norm solution can be obtained by choosing a special kind of initial matrix. In addition, the unique optimal approximation solutions X^1 and X^2 to the given matrices X~1 and X~2 in Frobenius norm can be obtained by finding the least norm solution of a new pair of matrix equations A1X¯1B1+A2X¯2B2=E¯, C1X¯1D1+C2X¯2D2=F¯, where E¯=E-A1X~1B1-A2X~2B2, F¯=F-C1X~1D1-C2X~2D2. The given numerical example demonstrates that the iterative algorithm is efficient. Especially, when the numbers of the parameter matrices A1,A2,B1,B2,C1,C2,D1,D2 are large, our algorithm is efficient as well.

1. Introduction

Throughout the paper, we denote the set of all m×n real matrix by Rm×n, the transpose matrix of A by AT, the identity matrix of order n by In, the Kronecker product of A and B by AB, the mn×1 vector formed by the vertical concatenation of the respective columns of a matrix ARm×n by vec(A), the trace of a matrix A by tr(A), and the Frobenius norm of a matrix A by A where A=tr(ATA).

In this paper, we consider the following two problems.

Problem 1.

For the given matrices A1Rp×k, A2Rp×m, B1Rr×q, B2Rn×q, C1Rs×k, C2Rs×m, D1Rr×t, D2Rn×t, ERp×q, and FRs×t, find X1Rk×r and X2Rm×n such that (1)A1X1B1+A2X2B2=E,C1X1D1+C2X2D2=F.

Problem 2.

When Problem 1 is consistent, let S denote the solution set of the pair of matrix equation (1). For the given matrices X~1Rk×r,  X~2Rm×n, find {X^1,X^2}S such that (2)X^1-X~12+X^2-X~22=min{X1,X2}S(X1-X~12+X2-X~22).

Problem 2 is to find the optimal approximation solutions to the given matrices X~1,X~2 in the solution set of Problem 1. It occurs frequently in experiment design (see, for instance, ). In the recent years, the matrix optimal approximation problem has been studied extensively (e.g., ).

The research on solving matrix equation pair has been actively ongoing for the last 30 years or more. For instance, Mitra  gave conditions for the existence of a solution and a representation of the general common solution to AXB=E,  CXD=F. Shinozaki and Sibuya  and van der Woude  discussed conditions for the existence of a common solution to AXB=E,  CXD=F. Navarra et al.  derived sufficient and necessary conditions for the existence of a common solution to AXB=E,  CXD=F. Yuan  obtained an analytical expression of the least-squares solutions of AXB=E,  CXD=F by using the generalized singular value decomposition (GSVD) of matrices. Dehghan and Hajarian  presented some examples to show a motivation for studying the general coupled matrix equations j=1lAijXjBij=Ci,  i=1,2,,l, and  constructed an iterative algorithm to solve the general coupled matrix equations j=1pAijXjBij=Mi, i=1,2,,p. Wang [19, 20] gave the centrosymmetric solution to the system of quaternion matrix equations A1X=C1, A3XB3=C3. Wang  also solved a system of matrix equations over arbitrary regular rings with identity.

Recently, some finite iterative algorithms have also been developed to solve matrix equations. Ding et al. [22, 23] and Xie et al. [24, 25] studied the iterative solutions of matrix equations AXB=F and AiXBi=Fi and generalized Sylvester matrix equations AXB+CXD=F and AXB+CXTD=F. They presented a gradient based and a least-squares based iterative algorithms for the solution. Li et al. [26, 27] and Zhou et al. [28, 29] considered iterative method for some coupled linear matrix equations. Deng et al.  studied the consistent conditions and the general expressions about the Hermitian solutions of the matrix equations (AX,XB)=(C,D) and designed an iterative method for its Hermitian minimum norm solutions. Li and Wu  gave symmetric and skew-antisymmetric solutions to certain matrix equations A1X=C1, XB3=C3 over the real quaternion algebra H. For more studies on iterative algorithms on coupled matrix equations, we refer to [3, 1012, 17, 3237]. Peng et al.  presented iterative methods to obtain the symmetric solutions of AXB=E, CXD=F. Sheng and Chen  presented a finite iterative method; when AXB=E, CXD=F is consistent. Liao and Lei  presented an analytical expression of the least-squares solution and an algorithm for AXB=E, CXD=F with the minimum norm. Peng et al.  presented an algorithm for the least-squares reflexive solution. Dehghan and Hajarian  presented an iterative algorithm for solving a pair of matrix equations AXB=E, CXD=F over generalized centrosymmetric matrices. Cai and Chen  presented an iterative algorithm for the least-squares bisymmetric solutions of the matrix equations AXB=E, CXD=F. Yin and Huang  presented an iterative algorithm to solve the least squares generalized reflexive solutions of the matrix equations AXB=E, CXD=F.

However, to our knowledge, there has been little information on finding the solutions to the system (1) by iterative algorithm. In this paper, an efficient iterative algorithm is presented to solve the system (1) for any real matrices X1,X2. The suggested iterative algorithm, automatically determines the solvability of equations pair (1). When the pair of equations is consistent, then, for any initial matrices X10 and X20, the solution can be obtained in the absence of round errors, and the least norm solution can be obtained by choosing a special kind of initial matrix. In addition, the unique optimal approximation solutions X^1 and X^2 to the given matrices X~1 and X~2 in Frobenius norm can be obtained by finding the least norm solution of a new pair of matrix equations A1X¯1B1+A2X¯2B2=E¯, C1X¯1D1+C2X¯2D2=F¯, where E¯=E-A1X~1B1-A2X~2B2, F¯=F-C1X~1D1-C2X~2D2. The given numerical examples demonstrate that our iterative algorithm is efficient. Especially, when the numbers of the parameter matrices A1,A2,B1,B2,C1,C2,D1,D2 are large, our algorithm is efficient as well while the algorithm of  is not convergent. That is, our algorithm has merits of good numerical stability and ease to program.

The rest of this paper is outlined as follows. In Section 2, we first propose an efficient iterative algorithm for solving Problem 1; then we give some properties of this iterative algorithm. We show that the algorithm can obtain a solution group (the least Frobenius norm solution group) for any (special) initial matrix group in the absence of roundoff errors. In Section 3, a numerical example is given to illustrate that our algorithm is quite efficient.

2. Iterative Algorithm for Solving Problems <xref ref-type="statement" rid="problem1.1">1</xref> and <xref ref-type="statement" rid="problem1.2">2</xref>

In this section, we present the iterative algorithm for the consistence of the system (1).

Algorithm 3.

(1) Input matrices A1Rp×k, A2Rp×m, B1Rr×q, B2Rn×q, C1Rs×k, C2Rs×m, D1Rr×t, D2Rn×t, ERp×q, FRs×t, X11Rk×r, and X21Rm×n (where X11, X21 are any initial matrices).

(2) Calculate (3)E1=E,F1=F,P11=A1TE1B1T+C1TF1D1T,P21=A2TE1B2T+C2TF1D2T,β1=(tr[(E1)T(A1P11B1+A2P21B2)]+tr[(F1)T(C1P11D1+C2P21D2)])  ×(A1P11B1+A2P21B22+C1P11D1+C2P21D22)-1,ΔX11=β1P11,ΔX21=β1P21,k=1.

(3) If ΔX=diag(ΔX1k,ΔX2k)=0 (k=1,2,), then stop. Otherwise, (4)X1k+1=X1k+ΔX1k,X2k+1=X2k+ΔX2k.

(4) Calculate (5)Ek+1=Ek-(A1ΔX1kB1+A2ΔX2kB2),Fk+1=Fk-(C1ΔX1kD1+C2ΔX2kD2),P1k+1=A1TEk+1B1T+C1TFk+1D1T,P2k+1=A2TEk+1B2T+C2TFk+1D2T,βk+1=(tr[(Ek+1)T(A1P1k+1B1+A2P2k+1B2)]+tr[(Fk+1)T(C1P1k+1D1+C2P2k+1D2)])×(A1P1k+1B1+A2P2k+1B22+C1P1k+1D1+C2P2k+1D22)-1,ΔX1k+1=βk+1P1k+1,ΔX2k+1=βk+1P2k+1,k=k+1. Go to (3).

Lemma 4.

In Algorithm 3, the choice of βk makes diag(Ek+1,Fk+1) reach a minimum and diag(Ek+1,Fk+1) and diag(A1ΔX1kB1+A2ΔX2kB2,C1ΔX1kD1+C2ΔX2kD2) orthogonal to each other.

Proof.

From Algorithm 3, we have (6)diag(Ek+1,Fk+1)2=diag(Ek-(A1ΔX1kB1+A2ΔX2kB2),Fk-(C1ΔX1kD1+C2ΔX2kD2))2=diag(Ek-(A1βkP1kB1+A2βkP2kB2),Fk-(C1βkP1kD1+C2βkP2kD2))2=Ek-(A1βkP1kB1+A2βkP2kB2)2+Fk-(C1βkP1kD1+C2βkP2kD2)2=Ek2+Fk2-2[tr(Ek,A1P1kB1+A2P2kB2)+tr(Fk,C1P1kD1+C2P2kD2)]βk+[A1P1kB1+A2P2kB22+C1P1kD1+C2P2kD22](βk)2. From the above, the condition of diag(Ek+1,Fk+1) reaching a minimum is (7)βk=(tr(Ek,A1P1kB1+A2P2kB2)+tr(Fk,C1P1kD1+C2P2kD2))×(A1P1kB1+A2P2kB22+C1P1kD1+C2P2kD22)-1.

On the other hand, if the choice of βk makes diag(Ek+1,Fk+1) and diag(A1ΔX1kB1+A2ΔX2kB2,C1ΔX1kD1+C2ΔX2kD2) orthogonal to each other, that is, tr[diag(Ek+1,Fk+1)Tdiag(A1ΔX1kB1+A2ΔX2kB2,C1ΔX1kD1+C2ΔX2kD2)]=0, we can have the same βk as (7).

Theorem 5.

Algorithm 3 is bound to be convergent.

Proof.

From Algorithm 3 and Lemma 4 we have (8)diag(Ek,Fk)=diag(Ek+1,Fk+1)diag(Ek,Fk)m+diag(A1ΔX1kB1+A2ΔX2kB2,000000000000000000C1ΔX1kD1+C2ΔX2kD2),diag(Ek,Fk)2=diag(Ek+1,Fk+1)+diag(A1ΔX1kB1+A2ΔX2kB2,00000000000000000000000C1ΔX1kD1+C2ΔX2kD2)2=diag(Ek+1,Fk+1)2+diag(A1ΔX1kB1+A2ΔX2kB2,C1ΔX1kD1+C2ΔX2kD2)2 such that (9)diag(Ek+1,Fk+1)2=diag(Ek,Fk)2-diag(A1ΔX1kB1+A2ΔX2kB2,C1ΔX1kD1+C2ΔX2kD2)2diag(Ek,Fk)2. From (9), we know that Algorithm 3 is convergent.

Lemma 6 (see [<xref ref-type="bibr" rid="B22">41</xref>]).

Suppose that the consistent system of linear equations My=b has a solution y0R(MT); then y0 is the least Frobenius norm solution of the system of linear equations.

Theorem 7.

Assume that the system (1) is consistent. Let X11=A1TYB1T+C1TZD1T, X21=A2TYB2T+C2TZD2T be initial matrices where YRp×q, ZRs×t are any initial matrices, or, especially, X11=0, X21=0; then the solution generated by Algorithm 3 is the least Frobenius norm solution to (1).

Proof.

If (1) is consistent, from X11=A1TYB1T+C1TZD1T, X21=A2TYB2T+C2TZD2T, using Algorithm 3, we have the iterative solution pair X1k,X2k of (1) as the following: (10)X1k=X1k-1+ΔX1k-1=X11+ΔX11++ΔX1k-1=A1TYB1T+C1TZD1T+A1T[β1E1++βk-1Ek-1]B1T+C1T[β1F1++βk-1Fk-1]D1T=A1TMB1T+C1TND1T,X2k=X2k-1+ΔX2k-1=X21+ΔX21++ΔX1k-1=A2TYB2T+C2TZD2T+A2T[β1E1++βk-1Ek-1]B2T+C2T[β1F1++βk-1Fk-1]D2T=A2TMB2T+C2TND2T.

We know that (1) is equivalent to the system (11)(B1TA1B2TA2D1TC1D2TC2)(vec(X1)vec(X2))=(vec(E)vec(F)). From (10) and (11) we have (12)(vec(A1TMB1T+C1TND1T)vec(A2TMB2T+C2TND2T))=(B1A1TD1C1TB2A2TD2C2T)(vec(M)vec(N))=(B1TA1B2TA2D1TC1D2TC2)T×(vec(M)vec(N))R((B1TA1B2TA2D1TC1D2TC2)T), where R(*) is the column space of matrix *.

Considering Lemma 6, with the initial matrices X11=A1TYB1T+C1TZD1T, X21=A2TYB2T+C2TZD2T, where YRp×q, ZRs×t are arbitrary, or, especially, X11=0 and X21=0, then the solution pair X1k,X2k generated by Algorithm 3 is the least Frobenius norm solution of the matrix equations (1).

Suppose that Problem 1 is consistent. Obviously the solution set S of (1) is nonempty. For given matrices pair X~1Rk×r, X~2Rm×n, we can write (13)A1X1B1+A2X2B2=E,C1X1D1+C2X2D2=F,{A1(X1-X~1)B1+A2(X2-X~2)B2=E-A1X~1B1-A2X~2B2,C1(X1-X~1)D1+C2(X2-X~2)D2=F-C1X~1D1-C2X~2D2. Let X¯1=X1-X~1, X¯2=X2-X~2, E¯=E-A1X~1B1-A2X~2B2, and F¯=F-C1X~1D1-C2X~2D2. Then Problem 2 is equivalent to find the least Frobenius norm solution pair of the system (14)A1X¯1B1+A2X¯2B2=E¯,C1X¯1D1+C2X¯2D2=F¯, which can be obtained using Algorithm 3 with the initial matrix pair X¯11=A1TYB1T+C1TZD1T, X¯21=A2TYB2T+C2TZD2T where YRp×q and ZRs×t are arbitrary, or especially, X¯11=0, X¯21=0, and the solution of the matrix optimal approximation Problem 2 can be represented as X^1=X¯1k+X~1, X^2=X¯2k+X~2.

3. An Example

In this section, we show a numerical example to illustrate the efficiency of Algorithm 3. All computations are performed by MATLAB 7. For the influence of the error of calculation, we consider the matrix R as a zero matrix if R<10-10.

Example 1.

Consider the solution of the linear matrix equations (15)A1X1B1+A2X2B2=E,C1X1D1+C2X2D2=F, where (16)A1=(139105541241765015935175191196147),B1=(1311710387116198856745152),A2=(27602132179574094),B2=(10676921283128157114121614213615910175),C1=(38819215410014519443821981291491586454),D1=(883114071135146),C2=(463115390779137519),D2=(9690551111435124179173),E=(843307775981667137224360096099422471126705896220689126164437410412443246148712941612351115980470653827120550138162343221431798113168541721480518956522),F=(810469110054438139792238672308125463671638483276665841138225813330665106135171383124017573398411150350328477285952).

In this example, the numbers of the parameter matrices A1,A2,B1,B2,C1,C2,D1,D2 are larger than the numbers of the parameter matrices in the example of . It can be verified that these matrix equations are consistent and have the solution as (17)X1=(534832129175193),X2=(13321641742786).

Let (18)X10=(000000),X20=(000000).

(1) Using Algorithm 3 and iterate 10309 steps, we obtain the least Frobenius norm solution pair of the matrix equation in Example 1 as follows: (19)X1=(53.000048.000032.0000129.0000175.0000193.0000),X2=(133.00002.0000164.0000174.000027.000086.0000). The obtained sequence ΔX are presented in Figure 1.

The obtained sequence ΔX by Algorithm 3 for Example 1.

(2) Using the algorithm of , to this example, the iteration is not convergent. The obtained result is presented in Figure 2.

The relative error of the solution and the residual by the algorithm of  for Example 1.

This numerical example demonstrates that our algorithm has merits of good numerical stability and ease to program.

Acknowledgments

This research was supported by the Grants from the Key Project of Scientific Research Innovation Foundation of Shanghai Municipal Education Commission (13ZZ080), the National Natural Science Foundation of China (11171205), the Natural Science Foundation of Shanghai (11ZR1412500), and the Nature Science Foundation of Anhui Provincial Education (ky2008b253, KJ2013A248).

Meng T. Leondes C. Experimental design and decision support, in expert systems The Technology of Knowledge Management and Decision Making for the 21st Century 2001 1 New York, NY, USA Academic Press Dehghan M. Hajarian M. An iterative algorithm for solving a pair of matrix equations AYB=E, CYD=F over generalized centro-symmetric matrices Computers & Mathematics with Applications 2008 56 12 3246 3260 10.1016/j.camwa.2008.07.031 MR2474579 Dehghan M. Hajarian M. An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation Applied Mathematics and Computation 2008 202 2 571 588 10.1016/j.amc.2008.02.035 MR2435692 ZBL1154.65023 Andrew A. L. Solution of equations involving centrosymmetric matrices Technometrics 1973 15 2 405 407 Navarra A. Odell P. L. Young D. M. A representation of the general common solution to the matrix equations A1XB1=C1 and A2XB2=C2 with applications Computers & Mathematics with Applications 2001 41 7-8 929 935 10.1016/S0898-1221(00)00330-8 MR1826896 ZBL0983.15016 Peng Y.-X. Hu X.-Y. Zhang L. An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations A1XB1=C1, A2XB2=C2 Applied Mathematics and Computation 2006 183 2 1127 1137 10.1016/j.amc.2006.05.124 MR2294070 ZBL1134.65032 Peng Z.-H. Hu X.-Y. Zhang L. An efficient algorithm for the least-squares reflexive solution of the matrix equation A1XB1=C1;A2XB2=C2 Applied Mathematics and Computation 2006 181 2 988 999 10.1016/j.amc.2006.01.071 MR2269978 ZBL1115.65048 Sheng X. Chen G. A finite iterative method for solving a pair of linear matrix equations (AXB,CXD)=(E,F) Applied Mathematics and Computation 2007 189 2 1350 1358 10.1016/j.amc.2006.12.026 MR2331808 ZBL1133.65026 Li N. Wang Q. W. Iterative algorithm for solving a class of quaternion matrix equation over the generalized (P,Q)-reflexive matrices Abstract and Applied Analysis 2013 2013 15 831656 10.1155/2013/831656 Wu A.-G. Feng G. Duan G.-R. Wu W.-J. Finite iterative solutions to a class of complex matrix equations with conjugate and transpose of the unknowns Mathematical and Computer Modelling 2010 52 9-10 1463 1478 10.1016/j.mcm.2010.06.010 MR2719531 ZBL1205.15027 Wu A.-G. Feng G. Duan G.-R. Wu W.-J. Iterative solutions to coupled Sylvester-conjugate matrix equations Computers & Mathematics with Applications 2010 60 1 54 66 10.1016/j.camwa.2010.04.029 MR2651883 ZBL1198.65083 Wu A.-G. Li B. Zhang Y. Duan G.-R. Finite iterative solutions to coupled Sylvester-conjugate matrix equations Applied Mathematical Modelling 2011 35 3 1065 1080 10.1016/j.apm.2010.07.053 MR2740850 ZBL1211.15024 Yuan Y.-X. On the minimum norm solution of matrix equation AXB=E;CXD=F Journal of East China Shipbuilding Institute 2001 15 3 34 37 2-s2.0-0035361105 Mitra S. K. Common solutions to a pair of linear matrix equations A1XB1=C1 and A2XB2=C2 1973 74 213 216 MR0320028 ZBL0262.15010 Shinozaki N. Sibuya M. Consistency of a pair of matrix equations with an application Keio Science and Technology Reports 1975 27 10 141 146 MR0382306 van der Woude J. W. Freeback decoupling and stabilization for linear systems with multiple exogenous variables [Ph.D. thesis] 1987 Eindhoven, The Netherlands Technical University of Eindhoven Dehghan M. Hajarian M. The general coupled matrix equations over generalized bisymmetric matrices Linear Algebra and Its Applications 2010 432 6 1531 1552 10.1016/j.laa.2009.11.014 MR2580446 ZBL1187.65042 Dehghan M. Hajarian M. The reflexive and anti-reflexive solutions of a linear matrix equation and systems of matrix equations The Rocky Mountain Journal of Mathematics 2010 40 3 825 848 10.1216/RMJ-2010-40-3-825 MR2665204 ZBL1198.15011 Wang Q.-W. Sun J.-H. Li S.-Z. Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra Linear Algebra and Its Applications 2002 353 169 182 10.1016/S0024-3795(02)00303-8 MR1919635 ZBL1004.15017 Wang Q.-W. Bisymmetric and centrosymmetric solutions to systems of real quaternion matrix equations Computers & Mathematics with Applications 2005 49 5-6 641 650 10.1016/j.camwa.2005.01.014 MR2134960 ZBL1138.15003 Wang Q.-W. A system of matrix equations and a linear matrix equation over arbitrary regular rings with identity Linear Algebra and Its Applications 2004 384 43 54 10.1016/j.laa.2003.12.039 MR2055342 ZBL1058.15015 Ding F. Liu P. X. Ding J. Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle Applied Mathematics and Computation 2008 197 1 41 50 10.1016/j.amc.2007.07.040 MR2396289 ZBL1143.65035 Ding J. Liu Y. Ding F. Iterative solutions to matrix equations of the form AiXBi=Fi Computers & Mathematics with Applications 2010 59 11 3500 3507 10.1016/j.camwa.2010.03.041 MR2646321 ZBL1197.15009 Xie L. Ding J. Ding F. Gradient based iterative solutions for general linear matrix equations Computers & Mathematics with Applications 2009 58 7 1441 1448 10.1016/j.camwa.2009.06.047 MR2555281 ZBL1189.65083 Xie L. Liu Y. Yang H. Gradient based and least squares based iterative algorithms for matrix equations AXB+CXTD=F Applied Mathematics and Computation 2010 217 5 2191 2199 10.1016/j.amc.2010.07.019 MR2727965 ZBL1210.65097 Li Z.-Y. Wang Y. Zhou B. Duan G.-R. Least squares solution with the minimum-norm to general matrix equations via iteration Applied Mathematics and Computation 2010 215 10 3547 3562 10.1016/j.amc.2009.10.052 MR2578938 ZBL1186.65047 Li Z.-Y. Zhou B. Wang Y. Duan G.-R. Numerical solution to linear matrix equation by finite steps iteration IET Control Theory & Applications 2010 4 7 1245 1253 10.1049/iet-cta.2009.0015 MR2768248 Zhou B. Lam J. Duan G.-R. On Smith-type iterative algorithms for the Stein matrix equation Applied Mathematics Letters 2009 22 7 1038 1044 10.1016/j.aml.2009.01.012 MR2522996 ZBL1179.15016 Zhou B. Lam J. Duan G.-R. Gradient-based maximal convergence rate iterative method for solving linear matrix equations International Journal of Computer Mathematics 2010 87 1–3 515 527 10.1080/00207160802123458 MR2598758 ZBL1188.65058 Deng Y.-B. Bai Z.-Z. Gao Y.-H. Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations Numerical Linear Algebra with Applications 2006 13 10 801 823 10.1002/nla.496 MR2278194 ZBL1174.65382 Li Y.-T. Wu W.-J. Symmetric and skew-antisymmetric solutions to systems of real quaternion matrix equations Computers & Mathematics with Applications 2008 55 6 1142 1147 10.1016/j.camwa.2007.06.015 MR2394352 ZBL1143.15012 Dehghan M. Hajarian M. An efficient algorithm for solving general coupled matrix equations and its application Mathematical and Computer Modelling 2010 51 9-10 1118 1134 10.1016/j.mcm.2009.12.022 MR2608897 ZBL1208.65054 Dehghan M. Hajarian M. On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations International Journal of Systems Science 2010 41 6 607 625 10.1080/00207720903072357 MR2662731 ZBL1196.65081 Zhou B. Li Z.-Y. Duan G.-R. Wang Y. Weighted least squares solutions to general coupled Sylvester matrix equations Journal of Computational and Applied Mathematics 2009 224 2 759 776 10.1016/j.cam.2008.06.014 MR2492909 ZBL1161.65034 Jonsson I. Kågström B. Recursive blocked algorithm for solving triangular systems. I. One-sided and coupled Sylvester-type matrix equations ACM Transactions on Mathematical Software 2002 28 4 392 415 10.1145/592843.592845 MR2003127 Zhou B. Duan G.-R. Li Z.-Y. Gradient based iterative algorithm for solving coupled matrix equations Systems & Control Letters 2009 58 5 327 333 10.1016/j.sysconle.2008.12.004 MR2512486 ZBL1159.93323 Jonsson I. Kågström B. Recursive blocked algorithm for solving triangular systems. II. Two-sided and generalized Sylvester and Lyapunov matrix equations ACM Transactions on Mathematical Software 2002 28 4 416 435 10.1145/592843.592846 MR2003128 Liao A.-P. Lei Y. Least-squares solution with the minimum-norm for the matrix equation (AXB,GXH)=(C,D) Computers & Mathematics with Applications 2005 50 3-4 539 549 10.1016/j.camwa.2005.02.011 MR2165440 ZBL1087.65040 Cai J. Chen G. An iterative algorithm for the least squares bisymmetric solutions of the matrix equations A1XB1=C1,A2XB2=C2 Mathematical and Computer Modelling 2009 50 7-8 1237 1244 10.1016/j.mcm.2009.07.004 MR2568114 ZBL1190.65061 Yin F. Huang G.-X. An iterative algorithm for the least squares generalized reflexive solutions of the matrix equations AXB=E;CXD=F Abstract and Applied Analysis 2012 2012 18 10.1155/2012/857284 857284 MR2898044 ZBL1242.65085 Peng Y.-X. Hu X.-Y. Zhang L. An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB=C Applied Mathematics and Computation 2005 160 3 763 777 10.1016/j.amc.2003.11.030 MR2113117 ZBL1068.65056