Abstract
An [Formula: see text] real matrix [Formula: see text] is said to be a symmetric orthogonal matrix if [Formula: see text]. An [Formula: see text] real matrix [Formula: see text] is called a generalized centro-symmetric matrix with respect to [Formula: see text], if [Formula: see text]. It is obvious that every [Formula: see text] matrix is also a generalized centro-symmetric matrix with respect to [Formula: see text] (identity matrix). In the present paper, we propose a gradient-based iterative algorithm to solve the generalized coupled Sylvester matrix equations [Formula: see text] over the generalized centro-symmetric matrix pair [Formula: see text]. It is proved that the iterative method is always convergent for any initial generalized centro-symmetric matrix pair [Formula: see text] Finally, a numerical example is discussed to illustrate the results.
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 callMore From: Transactions of the Institute of Measurement and Control
Disclaimer: 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.
