We discuss the term cancellation which makes the floating-point Gröbner basis computation unstable, and show that error accumulation is never negligible in our previous method. Then, we present a new method, which removes accumulated errors as far as possible by reducing matrices constructed from coefficient vectors by the Gaussian elimination. The method manifests amounts of term cancellations caused by the existence of approximate linearly dependent relations among input polynomials. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Sasaki, T., & Kako, F. (2010). Term cancellations in computing floating-point Gröbner bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6244 LNCS, pp. 220–231). https://doi.org/10.1007/978-3-642-15274-0_20
Mendeley helps you to discover research relevant for your work.