Showing math.NAShow all
2 papers · 1 filter
math.NA2021
A recursive eigenspace computation for the Canonical Polyadic decomposition
Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer
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 compu…
math.NA2021
Guarantees for existence of a best canonical polyadic approximation of a noisy low-rank tensor
Eric Evert, Lieven De Lathauwer
The canonical polyadic decomposition (CPD) of a low rank tensor plays a major role in data analysis and signal processing by allowing for unique recovery of underlying factors. How…