Abstract
Through the restricted singular value decomposition (RSVD) of the matrix triplet (C, A, B), we show in this note how to choose a variable matrix X such that the matrix pencil A − BXC attains its maximal and minimal ranks. As applications, we show how to use the RSVD to solve the matrix equation A = BXC.
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.
