Almost vanishing polynomials for sets of limited precision points

• Autores: Claudia Fassino
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 45, Nº 1, 2010, págs. 19-37
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • From the numerical point of view, given a set of s points whose coordinates are known with only limited precision, each set of s points whose elements differ from those of of a quantity less than data uncertainty can be considered equivalent to . We present an algorithm that, given and a tolerance e on the data error, computes a set of polynomials such that each element of is �almost vanishing� at and at all its equivalent sets . The set is not, in the general case, a basis of the vanishing ideal . Nevertheless can determine geometrical configurations simultaneously characterizing the set and all its equivalent sets .