Decompositions of a higher-order tensor in block terms — Part III: Alternating least squares algorithms
Lieven De Lathauwer, Dimitri Nion
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.
This package provides an implementation of the block term decomposition methods discussed in the ALS-BTD paper, as well as brief tutorials on how to use these methods.
L. De Lathauwer, D. Nion, "Decompositions of a higher-order tensor in block terms — Part III: Alternating least squares algorithms," SIAM Journal on Matrix Analysis and Applications, vol. 30, no. 3, pp. 1067-1083, Jan. 2008.
This repository can be cited as:
S. Hendrikx, M. Boussé, N. Vervliet, M. Vandecappelle, R. Kenis, and L. De Lathauwer, Tensorlab⁺, Available online, Version of Dec 2022 downloaded from https://www.tensorlabplus.net.