2014
DOI: 10.1007/s10208-014-9194-z
|View full text |Cite
|
Sign up to set email alerts
|

The Number of Singular Vector Tuples and Uniqueness of Best Rank-One Approximation of Tensors

Abstract: In this paper we discuss the notion of singular vector tuples of a complex valued d-mode tensor of dimension m 1 × . . . × m d . We show that a generic tensor has a finite number of singular vector tuples, viewed as points in the corresponding Segre product. We give the formula for the number of singular vector tuples. We show similar results for tensors with partial symmetry. We give analogous results for the homogeneous pencil eigenvalue problem for cubic tensors, i.e. m 1 = . . . = m d . We show uniqueness … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
102
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 71 publications
(102 citation statements)
references
References 20 publications
0
102
0
Order By: Relevance
“…This problem may be seen to be related to tensor eigenvalues [17] [53] [59] [35] [88]. It has been proved recently that the best rank-1 approximation of a symmetric tensor is symmetric [34]; a shorter proof can be found in [35], as well as uniqueness issues. So a question deserves to be raised: can the exact or approximate CP decompositions be computed by successive rank-1 approximations?…”
Section: The Case Of Rank-one Approximatementioning
confidence: 99%
“…This problem may be seen to be related to tensor eigenvalues [17] [53] [59] [35] [88]. It has been proved recently that the best rank-1 approximation of a symmetric tensor is symmetric [34]; a shorter proof can be found in [35], as well as uniqueness issues. So a question deserves to be raised: can the exact or approximate CP decompositions be computed by successive rank-1 approximations?…”
Section: The Case Of Rank-one Approximatementioning
confidence: 99%
“…Then the critical points of f T |S (n) are given by the Lagrange multipliers formulas [33]: 3) is bounded by the numbers given in [17].) Consider first the maximization problem of f T (x 1 , .…”
Section: Singular Values and Singular Tuples Of Tensorsmentioning
confidence: 99%
“…Work of Catanese and Trifogli [4] offers degree formulas for ED discriminants in various situations. Section 8 covers the approximation of tensors by rank one tensors, along the lines of [8,9].…”
Section: Introductionmentioning
confidence: 99%