We discuss computation of Gr�¨obner bases using approximate arithmetic for coefficients. We show how certain considerations of\r\ntolerance, corresponding roughly to absolute and relative error from numeric computation, allow us to obtain good approximate\r\nsolutions to problems that are overdetermined.We provide examples of solving overdetermined systems of polynomial equations.\r\nAs a secondary feature we show handling of approximate polynomial GCD computations, using benchmarks from the literature.
Loading....