Abstract
In this paper, we consider the iteration solutions of generalized coupled Sylvester-transpose matrix equations: A1XB1+C1YTD1=F1, A2YB2+C2XTD2=F2. When the coupled matrix equations are consistent, we propose a modified conjugate gradient method to solve the equations and prove that a solution (X∗,Y∗) can be obtained within finite iterative steps in the absence of roundoff-error for any initial value. Furthermore, we show that the minimum-norm solution can be got by choosing a special kind of initial matrices. When the coupled matrix equations are inconsistent, we present another modified conjugate gradient method to find the least-squares solution with the minimum-norm. Finally, some numerical examples are given to show the behavior of the considered algorithms.
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.
