Almost vanishing polynomials for sets of limited precision points

The nearest polynomial with a given zero, and similar problems

Hans J. Stetter · ACM SIGSAM Bulletin · 1999 · 59 citations · Full text

Computing, Computer Science, Cryptography +4

Approximate computation of zero-dimensional polynomial ideals

Daniel Heldt, Martin Kreuzer, Sebastian Pokutta et al. · Journal of Symbolic Computation · 2009 · 58 citations

Computing, Computer Science, Mathematics +13

Stable border bases for ideals of points

John Abbott, Claudia Fassino, Maria-Laura Torrente · Journal of Symbolic Computation · 2008 · 43 citations

Natural Sciences, Computer Science, Topology +5

Floating point Gröbner bases

Kiyoshi Shirayanagi · Mathematics and Computers in Simulation · 1996 · 41 citations

Natural Sciences, Computer Science, Mathematics +4

Approximate varieties, approximate ideals and dimension reduction

Tomas Sauer · Numerical Algorithms · 2007 · 26 citations

Natural Sciences, Computer Science, Mathematics +12