Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-(L_r,L_r,1) Terms
DOI10.1137/100805510zbMATH Open1239.15016OpenAlexW2017948584MaRDI QIDQ3225546FDOQ3225546
Authors: Lieven De Lathauwer 
Publication date: 21 March 2012
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100805510
Recommendations
- \((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- Blind Signal Separation via Tensor Decomposition With Vandermonde Factor: Canonical Polyadic Decomposition
- Tensor decompositions in rank \(+1\)
- Tensor Decompositions With Several Block-Hankel Factors and Application in Blind System Identification
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
- Approximate tensor decompositions: disappearance of many separations
- On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms
- From exponential analysis to Padé approximation and tensor decomposition, in one and more dimensions
- Decoupling multivariate polynomials: interconnections between tensorizations
- Approximate decoupling of multivariate polynomials using weighted tensor decomposition.
multilinear algebrasignal processingsingular value decompositionnumerical experimentshigher-order tensorexponential polynomialscanonical polyadic decompositionblind signal separationblock term decomposition
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cited In (21)
- Generalizing Caratheodory's uniqueness of harmonic parameterization to N dimensions
- Decomposition of a tensor into multilinear rank-\((M_r,N_r,\cdot)\) terms
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Tensor algorithms of blind separation of electromagnetic signals
- SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_{r,n},L_{r,n},1)\) terms. II: Algorithms
- On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- Tensor factorisation for narrowband single channel source decomposition
- On identifiability of higher order block term tensor decompositions of rank \(L_r \otimes\) rank-1
- Tensor approximation and signal processing applications
- Title not available (Why is that?)
- On partial and generic uniqueness of block term tensor decompositions
- From exponential analysis to Padé approximation and tensor decomposition, in one and more dimensions
- Fast Hankel tensor-vector product and its application to exponential data fitting.
- Nonlinear algebra and applications
- Tensor-based techniques for the blind separation of DS-CDMA signals
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_r,n,L_r,n,1)\) terms. I: Uniqueness
- \((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- From computation to comparison of tensor decompositions
- Exact line and plane search for tensor optimization
This page was built for publication: Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225546)
