کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
401850 | 676727 | 2010 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Almost vanishing polynomials for sets of limited precision points
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
From the numerical point of view, given a set X⊂Rn of s points whose coordinates are known with only limited precision, each set of s points whose elements differ from those of X of a quantity less than data uncertainty can be considered equivalent to X. We present an algorithm that, given X and a tolerance ε on the data error, computes a set G of polynomials such that each element of G is “almost vanishing” at X and at all its equivalent sets . The set G is not, in the general case, a basis of the vanishing ideal I(X). Nevertheless G can determine geometrical configurations simultaneously characterizing the set X and all its equivalent sets .
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 45, Issue 1, January 2010, Pages 19-37
Journal: Journal of Symbolic Computation - Volume 45, Issue 1, January 2010, Pages 19-37