BROWSE

Author Profile

Browsing by Author Carlos, Beltrán

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results [1 - 1] / 1
    • The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite
    Authors: Carlos, Beltrán; Paul, Breiding; Nick, Vannieuwenhoven;  Advisor: -;  Co-Author: - (2022)

    The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposition measures the sensitivity of the rank-1 summands with respect to structured perturbations. Those are perturbations preserving the rank of the tensor that is decomposed. On the other hand, the angular condition number measures the perturbations of the rank-1 summands up to scaling. We show for random rank-2 tensors that the expected value of the condition number is infinite for a wide range of choices of the density.