Abstract
The generalized singular value decomposition (GSVD) and the lifting technique combined with the Kronecker product are exploited to find reflexive and anti-reflexive (with respect to a generalized { k + 1 } -reflection matrix P ) solutions of the matrix equation A X B = C . The computational cost of the presented algorithm is studied and several numerical examples are presented.
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.
