Abstract
A minimal residual algorithm based on the idea of the classical CG method for the inconsisitent matrix equation AXB + CYD = E is constructed in this paper. By this method, the minimum norm least squares solution for anti-symmetric matrices can be obtained within finite iteration steps by choosing a special kind of initial iteration matrix when the matrix equation AXB + CYD = E is not consistent and an error bound is given. Finally, an example verifys the efficiency of the algorithm.
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.
