A recursive eigenspace computation for the Canonical Polyadic decomposition

The canonical polyadic decomposition (CPD) is a compact decomposition which expresses a tensor as a sum of its rank-1 components. A common step in the computation of a CPD is computing a generalized eigenvalue decomposition (GEVD) of the tensor. A GEVD provides an algebraic approximation of the CPD...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Evert, Eric, Vandecappelle, Michiel, De Lathauwer, Lieven
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Numerical Analysis Mathematics - Numerical Analysis
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!