Abstract
The iterative method is presented for obtaining the centrally symmetric (centrally antisymmetric) matrix pair(X,Y)solutions of the generalized coupled Sylvester-conjugate matrix equationsA1X+B1Y=D1X¯E1+F1,A2Y+B2X=D2Y¯E2+F2. On the condition that the coupled matrix equations are consistent, we show that the solution pair(X*,Y*)can be obtained within finite iterative steps in the absence of round-off error for any initial value given centrally symmetric (centrally antisymmetric) matrix. Moreover, by choosing appropriate initial value, we can get the least Frobenius norm solution for the new generalized coupled Sylvester-conjugate linear matrix equations. Finally, some numerical examples are given to illustrate that the proposed iterative method is quite efficient.
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.
