Abstract and Applied Analysis
Volume 2012 (2012), Article ID 857284, 18 pages
http://dx.doi.org/10.1155/2012/857284
Research Article

An Iterative Algorithm for the Least Squares Generalized Reflexive Solutions of the Matrix Equations 𝐴 𝑋 𝐡 = 𝐸 , 𝐢 𝑋 𝐷 = 𝐹

1School of Science, Sichuan University of Science and Engineering, Zigong 643000, China
2Geomathematics Key Laboratory of Sichuan Province, College of Mathematics, Chengdu University of Technology, Chengdu 610059, China

Received 10 October 2011; Accepted 9 December 2011

Academic Editor: Zhenya Yan

Copyright © 2012 Feng Yin and Guang-Xin Huang. 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.

Abstract

The generalized coupled Sylvester systems play a fundamental role in wide applications in several areas, such as stability theory, control theory, perturbation analysis, and some other fields of pure and applied mathematics. The iterative method is an important way to solve the generalized coupled Sylvester systems. In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: β€– ξ€· 𝐴 𝑋 𝐡 𝐢 𝑋 𝐷 ξ€Έ βˆ’ ξ€· 𝐸 𝐹 ξ€Έ β€– = min over generalized reflexive matrix 𝑋 . For any initial generalized reflexive matrix 𝑋 1 , by the iterative algorithm, the generalized reflexive solution 𝑋 βˆ— can be obtained within finite iterative steps in the absence of round-off errors, and the unique least-norm generalized reflexive solution 𝑋 βˆ— can also be derived when an appropriate initial iterative matrix is chosen. Furthermore, the unique optimal approximate solution  𝑋 to a given matrix 𝑋 0 in Frobenius norm can be derived by finding the least-norm generalized reflexive solution  𝑋 βˆ— of a new corresponding minimum Frobenius norm residual problem: m i n β€– ξ‚΅ 𝐴  𝑋 𝐡 𝐢  𝑋 𝐷 ξ‚Ά βˆ’ ξ‚€  𝐸  𝐹  β€– with  𝐸 = 𝐸 βˆ’ 𝐴 𝑋 0 𝐡 ,  𝐹 = 𝐹 βˆ’ 𝐢 𝑋 0 𝐷 . Finally, several numerical examples are given to illustrate that our iterative algorithm is effective.