Abstract
In this paper we present and provide a proof for a set of non-recursive formulae arising in the computation of the largest output-nulling and the smallest input-containing subspaces which have been used in a variety of contexts in the framework of the geometric approach. These expressions have been used in the literature both in the strictly proper and in the non-strictly proper case, but, to the best of our knowledge, a proof is still missing. These formulae are established here in the general possibly non-strictly proper case. Some ancillary side results of independent interest are also proposed.
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 callSimilar Papers
Disclaimer: 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.
