A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition

DOI10.1137/S0895479801394465zbMath1044.15020WikidataQ124806119 ScholiaQ124806119MaRDI QIDQ4443771

Tamara G. Kolda

Publication date: 18 January 2004

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

singular value decompositioncounter examplemultilinear algebrahigher-order tensorprincipal components analysismultidimensional arraysEckart-Young theoremorthogonal rank decompositionbest rank-\(k\) approximation

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Multilinear algebra, tensor calculus (15A69)

Related Items

Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems ⋮ Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization ⋮ Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations ⋮ Orthogonal and unitary tensor decomposition from an algebraic perspective ⋮ Rank properties and computational methods for orthogonal tensor decompositions ⋮ A contemporary linear representation theory for ordinary differential equations: multilinear algebra in folded arrays (folarrs) perspective and its use in multidimensional case ⋮ A tensor decomposition approach to data compression and approximation of ND systems ⋮ A proper generalized decomposition for the solution of elliptic problems in abstract form by using a functional Eckart-Young approach ⋮ A fully symmetric nonlinear biorthogonal decomposition theory for random fields ⋮ A probabilistic foundation for dynamical systems: theoretical background and mathematical formulation ⋮ Singular vectors of orthogonally decomposable tensors ⋮ Separation of variables for function generated high-order tensors ⋮ Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations ⋮ Adaptive cross approximation of multivariate functions ⋮ Towards theory of generic principal component analysis ⋮ A TT-Based Hierarchical Framework for Decomposing High-Order Tensors ⋮ An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors ⋮ Computing the maximal violation of Bell inequalities for multipartite qubit via partially symmetric tensor ⋮ A Higher Order Unscented Transform ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format

This page was built for publication: A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition