Abstract
It is proved that the range of a Sylvester map defined by two matrices of sizes p × p and q × q, respectively, plus matrices whose ranks are bounded above, cover all p × q matrices. The best possible upper bound on the ranks is found in many cases. An application is made to a minimal rank problem that is motivated by the theory of minimal factorizations of rational matrix functions.
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.
