$(L_r,L_r,1)$-decompositions, sparse component analysis, and the blind separation of sums of exponentials (Q5088657)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

(L_r,L_r,1)-decompositions, sparse component analysis, and the blind separation of sums of exponentials

scientific article; zbMATH DE number 7556090

Language	Label	Description	Also known as
default for all languages	No label defined
English	$(L_r,L_r,1)$-decompositions, sparse component analysis, and the blind separation of sums of exponentials	scientific article; zbMATH DE number 7556090

Statements

instance of

scholarly article

0 references

title

$(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials (English)

0 references

0 references

0 references

0 references

SIAM Journal on Matrix Analysis and Applications

0 references

publication date

13 July 2022

0 references

zbMATH Keywords

tensor decompositions

0 references

blind source separation

0 references

sparse component analysis

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Learning sparsely used overcomplete dictionaries via alternating minimization

0 references

A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries

0 references

$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

0 references

On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them

0 references

Algorithm 862

0 references

Dictionary learning and tensor decomposition via the sum-of-squares method

0 references

Underdetermined blind source separation using sparse representations

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Analysis of individual differences in multidimensional scaling via an $n$-way generalization of ``Eckart-Young'' decomposition

0 references

On Generic Identifiability of 3-Tensors of Small Rank

0 references

Identifiability of complete dictionary learning

0 references

CONFAC Decomposition Approach to Blind Identification of Underdetermined Mixtures Based on Generating Function Derivatives

0 references

PARAFAC-based unified tensor modeling for wireless communication systems with application to blind multiuser equalization

0 references

Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices

0 references

Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness

0 references

Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms

0 references

Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms

0 references

Löwner-Based Blind Signal Separation of Rational Functions With Applications

0 references

On the uniqueness of the canonical polyadic decomposition of third-order tensors. I: Basic results and uniqueness of one factor matrix

0 references

On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition

0 references

Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition

0 references

Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm

0 references

On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms

0 references

Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization

0 references

Uni-mode and partial uniqueness conditions for CANDECOMP/PARAFAC of three-way arrays with linearly dependent loadings

0 references

Tensor rank is NP-complete

0 references

Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics

0 references

Q3096060

0 references

A Decomposition for Three-Way Arrays

0 references

Underdetermined blind source separation based on sparse representation

0 references

Tensor Decomposition for Signal Processing and Machine Learning

0 references

Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-$(L_r,L_r,1)$ terms, and a new generalization

0 references

Uniqueness conditions for constrained three-way factor decompositions with linearly dependent loadings

0 references

Improved Uniqueness Conditions for Canonical Tensor Decompositions with Linearly Dependent Loadings

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

On identifiability of higher order block term tensor decompositions of rank $L_r \otimes$ rank-1

0 references

Blind source separation by sparse decomposition in a signal dictionary

0 references

full work available at URL

https://doi.org/10.1137/21m1426444

0 references

Identifiers

zbMATH Open document ID

1493.15077

0 references

DOI

10.1137/21M1426444

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi $(L r,L r,1)$-decompositions, sparse component analysis, and the blind separation of sums of exponentials

\((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials (Q5088657)

Statements

Identifiers

Sitelinks

Mathematics(1 entry)