This paper deals with developing a robust iterative algorithm to find the least-squares (P, Q)-orthogonal symmetric and skew-symmetric solution sets of the generalized coupled matrix equations. To this end, first, some properties of these type of matrices are established. Furthermore, an approach is offered to determine the optimal approximate (P, Q)-orthogonal (skew-)symmetric solution pair corresponding to a given arbitrary matrix pair. Some numerical experiments are reported to confirm the validity of the theoretical results and to illustrate the effectiveness of the proposed algorithm.
BeikFPASalkuyehDK (2011) On the global Krylov subspace methods for solving general coupled matrix equation. Computers and Mathematics with Applications62: 4605–4613.
2.
BeikFPASalkuyehDK (2013) The coupled Sylvester-transpose matrix equations over generalized centro-symmetric matrices. International Journal of Computer Mathematics90: 1546–1566.
3.
BeikFPASalkuyehDKMoghadamMM (2014) Gradient-based iterative algorithm for solving the generalized coupled Sylvester-transpose and conjugate matrix equations over reflexive (anti-reflexive) matrices. Transactions of the Institute of Measurement and Control36: 99–110.
4.
BennerPLaubAMehrmannV (1995) A collection of benchmark examples for the numerical solution of algebraic Riccati equations I: continuous-time case. Technical Report SPC 95_22, Fak. f. Mathematik, TU Chenmitz-Zwickau, 09107 Chemnitz, FRG.
5.
BernsteinDS (2009) Matrix Mathematics: theory, facts, and formulas, 2nd edition.Princeton, NJ: Princeton University Press.
6.
BjörckA (1996) Numerical Methods for Least Squares Problems. Philadelphia, PA: SIAM.
7.
CaiJChenG (2009) An iterative algorithm for the least squares bisymmetric solutions of the matrix equations A1XB1 = C1, A2XB2 = C2. Mathematical and Computer Modelling50: 1237–1244.
8.
CaiJChenGLiuQ (2010) An iterative method for the bisymmetric solutions of the consistent matrix equations A1XB1 = C1,A2XB2 = C2. International Journal of Computer Mathematics87: 2706–2715.
DingFChenT (2006) On iterative solutions of general coupled matrix equations. SIAM Journal on Control and Optimization44: 2269–2284.
11.
DingFLiuPXDingJ (2008) Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle. Applied Mathematics and Computation197: 41–50.
HajarianM (2014) Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations. Mathematical Methods in the Applied Sciences37: 2782–2798.
14.
HajarianM (2014a) A gradient-based iterative algorithm for generalized coupled Sylvester matrix equations over generalized centro-symmetric matrices. Transactions of the Institute of Measurement and Control36: 252–259.
15.
HajarianM (2014b) A matrix LSQR algorithm for solving constrained linear operator equations. Bulletin of the Iranian Mathematical Society40: 41–53.
16.
HajarianMDehghanM (2011) The generalized centro-symmetric and least squares generalized centro-symmetric solutions of the matrix equation AYB+CYTD = E. Mathematical Methods in the Applied Sciences34: 1562–1579.
17.
JulioAISotoRL (2015) Persymmetric and bisymmetric nonnegative inverse eigenvalue problem. Linear Algebra and its Applications469: 130–152.
18.
KarimiSDehghanM (2015) A general iterative approach for solving the general constrained linear matrix equations system. Transactions of the Institute of Measurement and Control. DOI: 10.1177/0142331215581640.
19.
KressnerDSchröderCWatkinsDS (2009) Implicit QR algorithms for palindromic and even eigenvalue problems. Numerical Algorithms51: 209–238.
20.
LancasterPRozsaP (1983) On the matrix equation AX+X*A*= C. SIAM Journal on Algebraic Discrete Methods4: 432–436.
21.
LaubAJ (1991) Invariant subspace methods for the numerical solution of Riccati equations. In: BittantiSLaubAJWillemsJC (eds), The Riccati Equation. New York: Springer, pp. 163–196.
22.
LiJFLiWPengP (2015) A hybrid algorithm for solving minimization problem over (R, S)-symmetric matrices with the matrix inequality constraint. Linear and Multilinear Algebra63: 1049–1072.
23.
LiHGaoZZhaoD (2014) Least squares solutions of the matrix equation AXB+CYD = E with the least norm for symmetric arrowhead matrices. Applied Mathematics and Computation226: 719–724.
PengZH (2013) The reflexive least squares solutions of the matrix equation A1X1B1+A2X2B2+…+AlXlBl = C with a submatrix constraint. Numerical Algorithms64: 455–480.
26.
PengZH (2015) The (R, S)-symmetric least squares solutions of the general coupled matrix equations. Linear Multilinear Algebra63: 1086–1105.
27.
PengZHHuXYZhangL (2007) The bisymmetric solutions of the matrix equation A1X1B1+A2X2B2+…+AlXlBl = C and its optimal approximation. Linear Algebra and its Applications426: 583–595.
28.
PengZHLiuJ (2009) The generalized bisymmetric solutions of the matrix equation A1X1B1+A2X2B2+…+AlXlBl = C and its optimal approximation. Numerical Algorithms50: 127–144.
29.
PengZHXinH(2013) The reflexive least squares solutions of the general coupled matrix equations with a submatrix constraint. Applied Mathematics and Computation225: 425–445.
30.
PengZHZhouZJ (2012) An efficient algorithm for the submatrix constraint of the matrix equation A1X1B1+A2X2B2+…+AlXlBl = C. International Journal of Computer Mathematics89: 1641–1662.
31.
QianJTanRCE (2013) On some inverse eigenvalue problems for Hermitian and generalized Hamiltonian/skew-Hamiltonian matrices. Journal of Computational and Applied Mathematics250: 28–38.
32.
ReichlL (2013) The transition to chaos: conservative classical systems and quantum manifestations. Springer Science & Business Media.
33.
SaadY (1995) Iterative Methods for Sparse Linear Systems. New York: PWS Press.
34.
SalkuyehDKBeikFPA (2014) An iterative method to solve symmetric positive definite matrix equations. Mathematical Reports16: 271–283.
35.
SalkuyehDKToutounianF (2006) New approaches for solving large Sylvester equations. Applied Mathematics and Computation173: 9–18.
36.
SarduvanMŞimşekSÖzdemirH (2014) On the best approximate (P, Q)-orthogonal symmetric and skew-symmetric solution of the matrix equation AXB = C. Journal of Numerical Mathematics22 (3): 255-269.
37.
ShengXChenG (2007) A infinite iterative method for solving a pair of linear matrix equations (AXB, CXD) = (E,F). Applied Mathematics and Computation189: 1350–1358.
38.
ShengXChenG (2010) An iterative method for the symmetric and skew symmetric solutions of a linear matrix equation AXB+CXD = E. Journal of Computational and Applied Mathematics233: 3030–3040.
39.
SongCFengJZhaoJ (2014) A new technique for solving continuous Sylvester-conjugate matrix equations. Transactions of the Institute of Measurement and Control36: 946–953.
40.
SuYChenG (2010) Iterative methods for solving linear matrix equation and linear matrix system. International Journal of Computer Mathematics87: 763–774.
41.
WangRS (2003) Functional Analysis and Optimization Theory. Beijing: Beijing University of Aeronautics Astronautics.
WuAGLvLDuanGR (2011b) Iterative algorithms for solving a class of complex conjugate and transpose matrix equations. Applied Mathematics and Computation217: 8343–8353.
44.
WuAGTongTDuanGR (2013) Finite iterative algorithm for solving coupled Lyapunov equations appearing in continuous-time Markov jump linear systems. International Journal of Systems Science44: 2082–2093.
45.
WuAGZhangELiuF (2012) On closed-form solutions to the generalized Sylvester-conjugate matrix equation. Applied Mathematics and Computation218: 9730–9741.
46.
ZhangZZHuXYZhangL (2005) On the Hermitian-generalized Hamiltonian solutions of linear matrix equations. SIAM Journal on Matrix Analysis and Applications27: 294–303.
47.
ZhaoLChenGLiuQ (2010) Least squares (P, Q)-orthogonal symmetric solutions of the matrix equation and its optimal approximation. Electronic Journal of Linear Algebra20: 537–551.
48.
ZhouKDoyleJGloverK (1995) Robust and Optimal Control. Upper Saddle River, NJ: Prentice-Hall.
