The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
DOI10.1007/s10208-014-9194-zzbMath1326.15036arXiv1210.8316OpenAlexW2125880378MaRDI QIDQ486689
Giorgio Ottaviani, Shmuel Friedland
Publication date: 16 January 2015
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.8316
singular value decompositionvector bundlesChern classesbest rank-\((r_1,\dots,r_d)\) approximationbest rank-one approximationhomogeneous pencil eigenvalue problem for cubic tensorspartially symmetrix tensorssingular vector tuples
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Eigenvalues, singular values, and eigenvectors (15A18) Characteristic classes and numbers in differential topology (57R20) Algorithms for approximation of functions (65D15) Projective techniques in algebraic geometry (14N05) Multilinear algebra, tensor calculus (15A69) (Equivariant) Chow groups and rings; motives (14C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvectors of tensors and algorithms for Waring decomposition
- Ranks derived from multilinear maps
- Eigenvalues and invariants of tensors
- The degree of the E-characteristic polynomial of an even order tensor
- The number of eigenvalues of a tensor
- An algorithm to find a maximum of a multilinear map over a product of spheres
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Eigenvalues of a real supersymmetric tensor
- Characteristic classes of Hermitian manifolds
- Maximum Block Improvement and Polynomial Optimization
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
- Most Tensor Problems Are NP-Hard
- Über homogene Polynome in ($L^{2}$)