Abstract

ABSTRACTFor given symmetric orthogonal matrices R, S, i.e. RT = R, R2 = I, ST = S, S2 = I, a matrix is termed (R, S)-conjugate matrix if . In this paper, an iterative method is constructed to find the (R, S)-conjugate solutions of the generalised coupled Sylvester matrix equations. The consistency of the considered matrix equations over (R, S)-conjugate matrices is discussed. When the matrix equations have a unique (R, S)-conjugate solution pair, the proposed method is convergent for any initial (R, S)-conjugate matrix pair under a loose restriction on the convergent factor. Moreover, the optimal convergent factor of the presented method is derived. Finally, some numerical examples are given to illustrate the results and effectiveness.

Full Text
Paper version not known

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 call

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.