Orthogonal tensor decompositions
From MaRDI portal
The singular value decomposition of a real \(m\times n\) matrix can be reformulated as an orthogonal decomposition in the tensor product \(\mathbb{R}^m \otimes \mathbb{R}^n\). The present paper is concerned with possible generalizations to multiple tensor products \(\mathbb{R}^{m_1} \otimes\cdots \otimes \mathbb{R}^{m_k}\), a prime consideration being whether an analogue of the Eckart-Young approximation theorem holds. Several definitions of orthogonality are put forward and their differences carefully illustrated on examples. With the Eckart-Young theorem in mind, the author describes a ``greedy tensor decomposition close in spirit to the SVD-\(k\) process of \textit{D. Leibovici} and \textit{R. Sabatier} [Linear Algebra Appl. 269, 307-329 (1998; Zbl 0889.65035)]. NEWLINENEWLINENEWLINEThe author claims to present, in section 5, a counterexample to Leibovici and Sabatier's extension of the Eckart-Young Theorem. However, several points remain unclear to the reviewer. First, the author's Example 5.1 and Leibovici and Sabatier's Theorem 2 refer to different definitions of orthogonality. Second, further argument seems to be required in Example 5.1 to show that \(A_1\) and \(A_2\) are the best rank 1 and 2 approximations as claimed.
Recommendations
- Rank-one approximation to high order tensors
- A singular value decomposition of a \(k\)-way array for a principal component analysis of multiway data, \(\text{PTA-}k\)
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
- On generic nonexistence of the Schmidt-Eckart-Young decomposition for complex tensors
- A new tensor decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- scientific article; zbMATH DE number 1009446
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- The product-product singular value decomposition of matrix triplets
Cited in
(only showing first 100 items - show all)- Z-eigenvalue methods for a global polynomial optimization problem
- Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- On the spectral problem for trivariate functions
- A new method of moments for latent variable models
- Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
- Orthogonal and unitary tensor decomposition from an algebraic perspective
- Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
- The convex geometry of linear inverse problems
- Monotonically convergent algorithms for symmetric tensor approximation
- 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
- Weighted Moore-Penrose inverses of arbitrary-order tensors
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- The tensor rank problem over the quaternions
- Unconstrained representation of orthogonal matrices with application to common principal components
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
- Nondegeneracy of eigenvectors and singular vector tuples of tensors
- Inference for low-rank tensors -- no need to debias
- On approximation algorithm for orthogonal low-rank tensor approximation
- Characterization of sampling patterns for low-tt-rank tensor retrieval
- Diagonalizable higher degree forms and symmetric tensors
- Bounds on strongly orthogonal ranks of tensors
- CP decomposition and weighted clique problem
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- Tucker tensor analysis of Matérn functions in spatial statistics
- A low-rank tensor-based algorithm for face recognition
- Condition numbers for the tensor rank decomposition
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- Non-intrusive low-rank separated approximation of high-dimensional stochastic models
- Low rank Tucker-type tensor approximation to classical potentials
- Tensor-product approximation to operators and functions in high dimensions
- Numerical multilinear algebra and its applications
- Rank properties and computational methods for orthogonal tensor decompositions
- Random Projections for Low Multilinear Rank Tensors
- Spline approximation, Kronecker products and multilinear forms.
- On generic nonexistence of the Schmidt-Eckart-Young decomposition for complex tensors
- A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms
- scientific article; zbMATH DE number 5896524 (Why is no real title available?)
- On the nuclear norm and the singular value decomposition of tensors
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Images, Frames, and Connectionist Hierarchies
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems
- On the convergence of a greedy rank-one update algorithm for a class of linear systems
- Gradient flows for optimization in quantum information and quantum dynamics: foundations and applications
- Eigenvectors of tensors and algorithms for Waring decomposition
- Matrix-variate and higher-order probabilistic projections
- A probabilistic foundation for dynamical systems: theoretical background and mathematical formulation
- Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- Numerical operator calculus in higher dimensions
- Greedy approaches to symmetric orthogonal tensor decomposition
- Partitioned treatment of uncertainty in coupled domain problems: a separated representation approach
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
- Singular vectors of orthogonally decomposable tensors
- The condition number of join decompositions
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Tensor inversion and its application to the tensor equations with Einstein product
- Range-separated tensor format for many-particle modeling
- Orthogonal Irreducible Decompositions of Tensors of High Orders
- Simplex factor models for multivariate unordered categorical data
- ITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATION
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Multiresolution low-rank tensor formats
- The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
- A sharp blockwise tensor perturbation bound for orthogonal iteration
- Computational and statistical tradeoffs via convex relaxation
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Numerical computation for orthogonal low-rank approximation of tensors
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Least-squares proper generalized decompositions for weakly coercive elliptic problems
- Orthogonal, exactly periodic subspace decomposition
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- Iterative algorithms for solving some tensor equations
- Bayesian modeling of temporal dependence in large sparse contingency tables
- News algorithms for tensor decomposition based on a reduced functional
- Fast tensor method for summation of long-range potentials on 3D lattices with defects.
- scientific article; zbMATH DE number 3105785 (Why is no real title available?)
- An Orthonormal Decomposition Method for Multidimensional Matrices
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
- Generalized inverses of Boolean tensors via the Einstein product
- Generalized low rank approximations of matrices
- Generalized low rank approximations of matrices
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
- The condition number of many tensor decompositions is invariant under Tucker compression
- Iterative tensor eigen rank minimization for low-rank tensor completion
- Further results on tensor nuclear norms
- 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
- Locally Optimal Eigenpairs of Orthogonally Decomposable Tensors: A Generalized Proof
- Tensor-based projection depth
- Matrix stretching
- A generalization of Hardy's inequality to infinite tensors
- Decomposing tensors via rank-one approximations
- The R-linear convergence of IPPDA for symmetric low rank orthogonal tensor approximation
- On the multiway principal component analysis
- Quantifying low rank approximations of third order symmetric tensors
This page was built for publication: Orthogonal tensor decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784344)
