Abstract
For any symmetric orthogonal matrix P, i.e., \( P^{\rm T} = P,\,P^{\rm T} P = I, \) the matrix X is said to be a generalized centrosymmetric matrix if \( PXP = X \) for any matrix X. The conjugate gradient iteration algorithm is presented to find the generalized centrosymmetric solution and its optimal approximation of the constraint matrix equation \( AXB + CXD = F. \) By this method, the solvability of the equation can be determined automatically. If the matrix equation \( AXB + CXD = F \) is consistent, then its generalized centrosymmetric solution can be obtained within finite iteration steps in the absence of round off errors for any initial symmetric matrix \( X_{1} , \) and generalized centrosymmetric solution with the least norm can be derived by choosing a proper initial matrix. In addition, the optimal approximation solution for a given matrix of the matrix equation \( AXB + CXD = F \) can be obtained by choosing the generalized centrosymmetric solution with the least norm of a new matrix equation \( A\tilde{X}B + C\tilde{X}D = \tilde{F}. \)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baksalary JK, Kala R (1980) The matrix equation. Linear Algebra Appl 37:141–147
Higham NJ (1988) Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl 103:103–118
Shim SY, Chen Y (2003) Least squares solution of matrix equation. SIAM J Matrix Anal Appl 24:802–808
Peng Y (2004) The iterative method for the solutions and the optimal approximation of the constrained matrix equation. Hunan University, Hunan
Liang M (2007) Iterative methods for several constrained matrix equation problems and associated optimal approximation. Lanzhou University, Gansu
Wu W (2011) The study of iterative algorithms for solving linear matrix equations. Nanchang University, Jiangxi
Liang K, Liu J (2011) The iterative algorithms for the minimum-norm solution and the least squares solution of the linear matrix equations \( A_{1} XB_{1} + C_{1} X^{\rm T} D_{1} = M_{1} ,\,A_{2} XB_{2} + C_{2} X^{\rm T} D_{2} = M_{2} \) Appl Math Comput 33:3166–3175
Ding J, Liu Y, Ding F (2010) Iterative solutions to matrix equations of the form \( A_{i} XB_{i} = F_{i} \) Comput Math Appl 59:3500–3507
Dajin L, Hailin Z, Dongjin Y (2008) An iterative algorithm for the centrosymmetric solutions and optimal approximation of \( AXB + CXD = F \) J Yangzhou Univ 11:9–13
Hailin Z (2010) An iterative method for symmetric solutions of the matrix equation \( AXB + CYD = F \) Math Numer Sinica 32:413–422
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Li, Q. (2013). An Iterative Algorithm for the Generalized Center Symmetric Solutions of a Class of Linear Matrix Equation and Its Optimal Approximation. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)