A Fast Implementation for the Canonical Polyadic Decomposition

Understand

A new implementation of the canonical polyadic decomposition (CPD) is presented.

• It features lower computational complexity and memory usage than the available state of art implementations available.
• The CPD of tensors is a challenging problem which has been approached in several manners.
• Alternating least squares algorithms were used for a long time, but they convergence properties are limited.