Abstract
The generalized Sylvester matrix equation ∑i=1sAiXBi+∑j=1tCjYDj=E with unknown matrices X and Y is encountered in many system and control applications. In this paper, a direct method is established to solve the least-squares symmetric and skew-symmetric solutions of the equation by using the Kronecker product and the generalized inverses and, the expression of the solution set S are provided. Moreover, an optimal approximation between a given matrix pair and the affine subspace S is discussed, and an explicit formula for the unique optimal approximation solution is presented. Finally, two numerical examples are given which demonstrate that the introduced algorithm is quite efficient.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
