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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
