Abstract
We study the completion problem for an orthogonal projector A of R n from knowledge of one or several of its columns, as well as the related matrix inverse problem of finding an orthogonal projector A with AX = Y for two given n by k matrices X and Y. Using geometric properties of orthogonal projections and of the singular value decomposition, we derive theoretical and numerical solutions for these problems. We give algorithms and test their MATLAB implementations.
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.
