Linear systems with a canonical polyadic decomposition constrained solution: Algorithms and applications

DOI10.1002/NLA.2190MaRDI QIDQ3120343zbMATH OpenOpenAlexFDO

Authors Martijn Boussé, Nico Vervliet, Otto Debals, Lieven De Lathauwer, Ignat Domanov

Publication date 1 March 2019

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/629903

zbMATH Keywords

higher-order tensorlinear systemsmultilinear algebramultilinear systemstensor decompositions

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-(1,L_r,L_r) Terms
• Canonical polyadic decomposition with a columnwise orthonormal factor matrix
• Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
• Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_{r,n},L_{r,n},1)\) terms. II: Algorithms
• An algebraic solution for the Candecomp/PARAFAC decomposition with circulant factors

Cited in

(4)

• A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
• Solving systems of polynomial equations -- a tensor approach
• The power of tensor-based approaches in cardiac applications
• ISLET: fast and optimal low-rank tensor regression via importance sketching

This page was built for publication: Linear systems with a canonical polyadic decomposition constrained solution: Algorithms and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120343)