arXiv · 1103.0203
Eigenvectors of tensors and algorithms for Waring decomposition
Abstract
A Waring decomposition of a (homogeneous) polynomial f is a minimal sum of powers of linear forms expressing f. Under certain conditions, such a decomposition is unique. We discuss some algorithms to compute the Waring decomposition, which are linked to the equation of certain secant varieties and to eigenvectors of tensors. In particular we explicitly decompose a general cubic polynomial in three variables as the sum of five cubes (Sylvester Pentahedral Theorem).
Explore related subjects
Keep this discovery
Luke Oeding, Giorgio Ottaviani. 2011-03-01. Eigenvectors of tensors and algorithms for Waring decomposition. https://doi.org/10.1016/j.jsc.2012.11.005
Cite the original work for its findings. Save a collection to share your selection of sources.