Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms

From MaRDI portal
Revision as of 22:38, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5320725

DOI10.1137/070690730zbMath1177.15033OpenAlexW2075427932MaRDI QIDQ5320725

Lieven De Lathauwer, Dimitri Nion

Publication date: 22 July 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070690730






Related Items (25)

On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decompositionThe condition number of many tensor decompositions is invariant under Tucker compressionThe average number of critical rank-one approximations to a tensorAn efficient randomized fixed-precision algorithm for tensor singular value decompositionAn Algebraic Approach to Nonorthogonal General Joint Block DiagonalizationComputation of the self-diffusion coefficient with low-rank tensor methods: application to the simulation of a cross-diffusion systemProvable stochastic algorithm for large-scale fully-connected tensor network decompositionTensor approximation of the self-diffusion matrix of tagged particle processesExploiting Efficient Representations in Large-Scale Tensor DecompositionsA note on the three-way generalization of the Jordan canonical formOn optimal low rank Tucker approximation for tensors: the case for an adjustable core sizeOn partial and generic uniqueness of block term tensor decompositionsPerturbation analysis for matrix joint block diagonalizationSuccessive unconstrained dual optimization method for~rank-one approximation to tensorsExact line and plane search for tensor optimizationStructuring data with block term decomposition: decomposition of joint tensors and variational block term decomposition as a parametrized mixture distribution modelDecomposition of a tensor into multilinear rank-\((M_r,N_r,\cdot)\) termsA fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional dataOn identifiability of higher order block term tensor decompositions of rank Lr⊗ rank-1Noninvasive fetal ECG extraction using doubly constrained block-term decompositionA Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decompositionDifferential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensorsJordan canonical form of three-way tensor with multilinear rank \((4,4,3)\)Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term DecompositionTensor factorisation for narrowband single channel source decomposition







This page was built for publication: Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms