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

2008235 citationsJournal Articlegreen Open Access

Authors

Lieven De Lathauwer · Laboratoire des systèmes et applications des technologies de l'information et de l'énergie

Abstract

In this paper we derive alternating least squares algorithms for the computation of the block term decompositions introduced in Part II. We show that degeneracy can also occur for block term decompositions.

Topics & Keywords

Tensor decomposition and applications Advanced Adaptive Filtering Techniques Blind Source Separation Techniques

Publication Details

Published in: SIAM Journal on Matrix Analysis and Applications

Volume 30, Issue 3, pp. 1067-1083

DOI: 10.1137/070690730

Field-Weighted Citation Impact: 3.81

Command Palette

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

Authors

Abstract

Topics & Keywords

Publication Details