Abstract
We study the problem of finding, in a real algebraic matrix group, the matrix nearest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results, and among the new results that we prove is a formula for the Euclidean distance degree of special linear groups.
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.
