An Iterative Algorithm for the Generalized Reflexive Solutions of the Generalized Coupled Sylvester Matrix Equations

Feng Yin and Guang-Xin Huang

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations (AXB − CYD, EXF − GYH) = (M, N), which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matrices X and Y. When the matrix equations are consistent, for any initial generalized reflexive matrix pair [X1, Y1], the generalized reflexive solutions can be obtained by the iterative algorithm within finite iterative steps in the absence of round‐off errors, and the least Frobenius norm generalized reflexive solutions can be obtained by choosing a special kind of initial matrix pair. The unique optimal approximation generalized reflexive solution pair [X∧,Y∧] to a given matrix pair [X0, Y0] in Frobenius norm can be derived by finding the least‐norm generalized reflexive solution pair [X̃*,Ỹ*] of a new corresponding generalized coupled Sylvester matrix equation pair (AX̃B-CỸD,EX̃F-GỸH)=(M̃,Ñ), where M̃=M-AX0B+CY0D,Ñ=N-EX0F+GY0H. Several numerical examples are given to show the effectiveness of the presented iterative algorithm.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/152805

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:152805

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().