Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
Publication:5320726
DOI10.1137/06066518XzbMath1167.14038arXivmath/0607647OpenAlexW2132267493WikidataQ60307005 ScholiaQ60307005MaRDI QIDQ5320726
Publication date: 22 July 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0607647
principal component analysishyperdeterminantscandecompparafactensor ranktensorstensor decompositionsmultidimensional arrayslow-rank tensor approximationsEckart-Young theoremnumerical multilinear algebramultiway arraysBrégman divergence of tensors
Factor analysis and principal components; correspondence analysis (62H25) Vector and tensor algebra, theory of invariants (15A72) Semialgebraic sets and related spaces (14P10) Decomposition methods (49M27) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03) Canonical forms, reductions, classification (15A21) General topics in the theory of data (68P01)
Related Items (only showing first 100 items - show all)
This page was built for publication: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem