Details:
Title  Approximate Gr\"obner bases, overdetermined polynomial systems, and approximate GCDs.  Author(s)  Daniel Lichtblau  Type  Article in Journal  Abstract  We discuss computation of Gröbner bases using approximate arithmetic for coefficients. We show how certain considerations of tolerance, corresponding roughly to absolute and relative error from numeric computation, allow us to obtain good approximate solutions to problems that are overdetermined. We provide examples of solving overdetermined systems of polynomial equations. As a secondary feature we show handling of approximate polynomial GCD computations, using benchmarks from the literature.  ISSN  20907842/e 
File 
 URL 
http://www.hindawi.com/journals/isrn/2013/352806/ 
Language  English  Journal  ISRN Comput. Math.  Volume  2013  Pages  12  Publisher  Hindawi (International Scholarly Research Network  ISRN), New York, NY  Year  2013  Edition  0  Translation 
No  Refereed 
No 
