Decomposition of a tensor into multilinear rank-\((M_r,N_r,\cdot)\) terms
From MaRDI portal
Publication:6577452
DOI10.1137/23M1557246zbMATH Open1544.15027MaRDI QIDQ6577452
Nico Vervliet, Eric Evert, Lieven De Lathauwer, Ignat Domanov
Publication date: 23 July 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
- On partial and generic uniqueness of block term tensor decompositions
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
- Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices
- A Decomposition for Three-Way Arrays
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- A Multilinear Singular Value Decomposition
- A Block Component Model-Based Blind DS-CDMA Receiver
- Tensor Decomposition for Signal Processing and Machine Learning
- Joint Independent Subspace Analysis: Uniqueness and Identifiability
- $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials
- On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms
- Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition
This page was built for publication: Decomposition of a tensor into multilinear rank-\((M_r,N_r,\cdot)\) terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577452)