Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4599283 | Linear Algebra and its Applications | 2015 | 14 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Jasmijn A. Baaijens, Jan Draisma,