By Topic

A Theory and an Algorithm of Approximate Gröbner Bases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sasaki, T. ; Univ. of Tsukuba, Tsukuba, Japan

In this paper, we treat polynomials with coefficients of floating-point numbers. The conventional concept of ideal breaks down for such polynomials, and we first define a concept of "approximate ideal''. Then, introducing "accuracy-guarding reductions'', we define approximate Groebner bases and give an algorithm for computing the approximate Groebner bases. We prove several theorems showing basic properties of approximate Groebner bases. The algorithm has been implemented, and we explain the approximate Groebner bases concretely by instructive examples.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on

Date of Conference:

26-29 Sept. 2011