Best rank \(k\) approximation for binary forms (Q1697769)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Best rank \(k\) approximation for binary forms
scientific article

    Statements

    Best rank \(k\) approximation for binary forms (English)
    0 references
    0 references
    0 references
    20 February 2018
    0 references
    The best rank \(k\) approximation problem in \(\mathrm{Sym}^d \mathbb{C}^n\) is to find the tensors of the form \(l_1^d+\dots+l_k^d,\) with \(l_j\in \mathrm{Sym} \mathbb{C}^n\), which has minimal distance to a given \(v\in \mathrm{Sym}^d \mathbb{C}^n\). The critical points for this distance are called critical rank \(k\) tensors. In the article [Rend. Ist. Mat. Univ. Trieste 47, 107--125 (2015; Zbl 1345.15006)], \textit{G. Ottaviani} and \textit{R. Paoletti} show that the linear space generated by the critical rank one tensors for \(f\in \mathrm{Sym}^d \mathbb{C}^2\) is a hyperplane \(H_f.\) In the present work the authors go a step further and show that the critical rank \(k\) tensors for \(f\in \mathrm{Sym}^d \mathbb{C}^2\) are contained in the same hyperplane \(H_f.\) As a consequence, every binary form may be written as linear combination of its critical rank one tensors.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    critical points
    0 references
    approximation problem
    0 references
    eigenvectors
    0 references
    binary forms
    0 references
    Eckart-Young theorem
    0 references
    spectral theorem
    0 references
    0 references
    0 references