Abstract
In this paper, we propose two iterative algorithms to solve the matrix equation AXB + CX T D = E. The first algorithm is applied when the matrix equation is consistent. In this case, for any (special) initial matrix X 1, a solution (the minimal Frobenius norm solution) can be obtained within finite iteration steps in the absence of roundoff errors. The second algorithm is applied when the matrix equation is inconsistent. In this case, for any (special) initial matrix X 1, a least squares solution (the minimal Frobenius norm least squares solution) can be obtained within finite iteration steps in the absence of roundoff errors. Some examples verify the efficiency of these 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.
