Distance Optimization and the Extremal Variety of the Grassmann Variety
- Publisher: Springer Verlag
The approximation of a multivector by a decomposable one is a distance-optimization problem between the multivector and the Grassmann variety of lines in a projective space. When the multivector diverges from the Grassmann variety, then the approximate solution sought is the worst possible. In this paper, it is shown that the worst solution of this problem is achieved, when the eigenvalues of the matrix representation of a related two-vector are all equal. Then, all these pathological points form a projective variety. We derive the equation describing this projective variety, as well as its maximum distance from the corresponding Grassmann variety. Several geometric and algebraic properties of this extremal variety are examined, providing a new aspect for the Grassmann varieties and the respective projective spaces.
21 references, page 1 of 3
views in local repository
downloads in local repository
The information is available from the following content providers: