Are diverging CP components always nearly proportional?

Details Are diverging CP components always nearly proportional? Are diverging CP components always nearly proportional?

2011-10-10

arxiv.org/abs/1110.1988v1

Mathematics

Algebraic Geometry

Scientific paper

Fitting a Candecomp/Parafac (CP) decomposition (also known as Canonical Polyadic decomposition) to a multi-way array or higher-order tensor, is equivalent to finding a best low-rank approximation to the multi-way array or higher-order tensor, where the rank is defined as the outer-product rank. However, such a best low-rank approximation may not exist due to the fact that the set of multi-way arrays with rank at most $R$ is not closed for $R\ge 2$. Nonexistence of a best low-rank approximation results in (groups of) diverging rank-1 components when an attempt is made to compute the approximation. In this note, we show that in a group of two or three diverging components, the components converge to proportionality almost everywhere. A partial proof of this result for larger groups of diverging components is also given. Also, we give examples of groups of three, four, and six non-proportional diverging components. These examples are shown to be exceptional cases.

Affiliated with

Also associated with

No associations

Rating

Are diverging CP components always nearly proportional? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Are diverging CP components always nearly proportional?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Are diverging CP components always nearly proportional? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-146967