$(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials
From MaRDI portal
Publication:5088657
DOI10.1137/21M1426444zbMath1493.15077OpenAlexW4282595528MaRDI QIDQ5088657
Nithin Govindarajan, Lieven De Lathauwer, Ethan N. Epperly
Publication date: 13 July 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1426444
Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)
Cites Work
- Unnamed Item
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- PARAFAC-based unified tensor modeling for wireless communication systems with application to blind multiuser equalization
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Blind Source Separation by Sparse Decomposition in a Signal Dictionary
- 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---Part I: Basic Results and Uniqueness of One Factor Matrix
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
- Uni-mode and Partial Uniqueness Conditions for CANDECOMP/PARAFAC of Three-Way Arrays with Linearly Dependent Loadings
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
- A Decomposition for Three-Way Arrays
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- Tensor rank is NP-complete
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- Greed is Good: Algorithmic Results for Sparse Approximation
- Algorithm 862
- Uniqueness Conditions for Constrained Three-Way Factor Decompositions with Linearly Dependent Loadings
- Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
- CONFAC Decomposition Approach to Blind Identification of Underdetermined Mixtures Based on Generating Function Derivatives
- Underdetermined blind source separation based on sparse representation
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Löwner-Based Blind Signal Separation of Rational Functions With Applications
- Tensor Decomposition for Signal Processing and Machine Learning
- On Generic Identifiability of 3-Tensors of Small Rank
- Improved Uniqueness Conditions for Canonical Tensor Decompositions with Linearly Dependent Loadings
- Identifiability of Complete Dictionary Learning
- On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms
- On identifiability of higher order block term tensor decompositions of rank Lr⊗ rank-1
- 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
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Underdetermined blind source separation using sparse representations
This page was built for publication: $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials
