THE CONDITION NUMBER OF JOIN DECOMPOSITIONS

被引:26
|
作者
Breiding, Paul [1 ]
Vannieuwenhoven, Nick [2 ]
机构
[1] Max Planck Inst Math Sci Leipzig, D-04103 Leipzig, Germany
[2] Katholieke Univ Leuven, Dept Comp Sci, B-3001 Heverlee, Belgium
关键词
join set; join decomposition problem; condition number; tensor rank decomposition; CP decomposition; Waring decomposition; block term decomposition; SECANT VARIETIES; TENSOR RANK; IDENTIFIABILITY; APPROXIMATION; UNIQUENESS; MODELS;
D O I
10.1137/17M1142880
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The join set of a finite collection of smooth embedded submanifolds of a mutual vector space is defined as their Minkowski sum. Join decompositions generalize some ubiquitous decompositions in multilinear algebra, namely, tensor rank, Waring, partially symmetric rank, and block term decompositions. This paper examines the numerical sensitivity of join decompositions to perturbations; specifically, we consider the condition number for general join decompositions. It is characterized as a distance to a set of ill-posed points in a supplementary product of Grassmannians. We prove that this condition number can be computed efficiently as the smallest singular value of an auxiliary matrix. For some special join sets, we characterized the behavior of sequences in the join set converging to the latter's boundary points. Finally, we specialize our discussion to the tensor rank and Waring decompositions and provide several numerical experiments confirming the key results.
引用
收藏
页码:287 / 309
页数:23
相关论文
共 50 条
  • [41] A NOTE ON BOUNDS FOR THE COP NUMBER USING TREE DECOMPOSITIONS
    Bonato, Anthony
    Clarke, Nancy E.
    Finbow, Stephen
    Fitzpatrick, Shannon
    Messinger, Margaret-Ellen
    CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2014, 9 (02) : 50 - 56
  • [42] ON SEQUENTIAL MACHINE DECOMPOSITIONS FOR REDUCING NUMBER OF DELAY ELEMENTS
    MENON, PR
    INFORMATION AND CONTROL, 1969, 15 (03): : 274 - &
  • [43] On decompositions of a cyclic permutation into a product of a given number of permutations
    B. S. Bychkov
    Functional Analysis and Its Applications, 2015, 49 : 81 - 85
  • [44] RESULTS ON GRUNDY CHROMATIC NUMBER OF JOIN GRAPH OF GRAPHS
    Maragatham, R. Stella
    Subramanian, A.
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2023, 40 (01): : 87 - 100
  • [45] On the number of join irreducibles and acyclicity in finite modular lattices
    Herrmann, Christian
    ALGEBRA UNIVERSALIS, 2010, 64 (3-4) : 433 - 444
  • [46] The minimal number of join irreducibles of a finite modular lattice
    Wild, M
    ALGEBRA UNIVERSALIS, 1996, 35 (01) : 113 - 123
  • [47] Total chromatic number of one kind of join graphs
    Li, Guangrong
    Zhang, Limin
    DISCRETE MATHEMATICS, 2006, 306 (16) : 1895 - 1905
  • [48] On local antimagic chromatic number of various join graphs
    Premalatha, K.
    Lau, G. C.
    Arumugam, S.
    Shiu, W. C.
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2023, 8 (04) : 693 - 714
  • [49] On the power domination number of corona product and join graphs
    Yuliana, I.
    Dafik
    Agustin, I.H.
    Wardani, D.A.R.
    Journal of Physics: Conference Series, 2019, 1211 (01):
  • [50] AN UPPER BOUND ON THE NUMBER OF EXECUTION NODES FOR A DISTRIBUTED JOIN
    CERI, S
    PELAGATTI, G
    INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 46 - 48