Best rank k approximation for binary forms
classification
🧮 math.AG
keywords
approximationbestrankproblembinarycriticalformshyperplane
read the original abstract
In the tensor space $\mathrm{Sym}^d {\mathbb R}^2$ of binary forms we study the best rank $k$ approximation problem. The critical points of the best rank $1$ approximation problem are the eigenvectors and it is known that they span a hyperplane. We prove that the critical points of the best rank $k$ approximation problem lie in the same hyperplane.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.