Abstract
The iterative method of generalized complex coupled Sylvester-transpose equations $ AXB+CY^TD = E,\; MX^TN+GYH = F $ over (R, S)-conjugate matrix solution $ (X,Y) $ is proposed. Usually, the type of matrix arises from some physical problems with some form of generalized reflexive symmetry. On the condition that the coupled matrix equations are consistent, we show the solution pair $ (X^*, Y^*) $ can be obtained by generalization of CG iterative method within finite iterative steps in the absence of roundoff-error for any initial guess chosen by the (R, S)-conjugate matrix. Moreover, the optimal approximation (R, S)-conjugate matrix solutions can be derived by searching the least Frobenius norm solution of the novel generalized complex coupled Sylvester-transpose matrix equations. Finally, some numerical examples are given to illustrate the presented iterative algorithm is 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.
