کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
11008025 1840488 2019 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Waring decompositions and identifiability via Bertini and Macaulay2 software
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Waring decompositions and identifiability via Bertini and Macaulay2 software
چکیده انگلیسی
Starting from our previous papers Angelini et al. (2018c) and Angelini et al. (2018a), we prove the existence of a non-empty Euclidean open subset whose elements are polynomial vectors with 4 components, in 3 variables, degrees, respectively, 2,3,3,3 and rank 6, which are not identifiable over C but are identifiable over R. This result has been obtained via computer-aided procedures suitably adapted to investigate the number of Waring decompositions for general polynomial vectors over the fields of complex and real numbers. Furthermore, by means of the Hessian criterion (Chiantini et al., 2014), we prove identifiability over C for polynomial vectors in many cases of sub-generic rank.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 91, March–April 2019, Pages 200-212
نویسندگان
,