Skip to main content

Term Cancellations in Computing Floating-Point Gröbner Bases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6244))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bodrato, M., Zanoni, A.: Intervals, syzygies, numerical Gröbner bases: a mixed study. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2006. LNCS, vol. 4194, pp. 64–76. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Chen, Y., Meng, X.: Border bases of positive dimensional polynomial ideals. In: Proceedings of SNC 2007, Symbolic Numeric Computation, London, Canada, pp. 65–71 (2007)

    Google Scholar 

  3. Fortuna, E., Gianni, P., Trager, B.: Degree reduction under specialization. J. Pure Appl. Algebra 164, 153–164 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gonzalez-Vega, L., Traverso, C., Zanoni, A.: Hilbert stratification and parametric Gröbner bases. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 220–235. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Kreuzer, M., Kehrein, A.: Computing border bases. J. Pure Appl. Alg. 200, 279–295 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Kalkbrener, M.: On the stability of Gröbner bases under specialization. J. Symb. Comput. 24, 51–58 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kako, F., Sasaki, T.: Proposal of “effective” floating-point number. Preprint of Univ. Tsukuba (May 1997) (unpublished)

    Google Scholar 

  8. Kondratyev, A., Stetter, H.J., Winkler, S.: Numerical computation of Gröbner bases. In: Proceedings of CASC 2004, Computer Algebra in Scientific Computing, St. Petersburg, Russia, pp. 295–306 (2004)

    Google Scholar 

  9. Mourrain, B.: A new criterion for normal form algorithms. LNCS, vol. 179, pp. 430–443. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  10. Mourrain, B.: Pythagore’s dilemma, symbolic-numeric computation, and the border basis method. In: Symbolic-Numeric Computations, Trends in Mathematics, pp. 223–243. Birkhäuser Verlag, Basel (2007)

    Chapter  Google Scholar 

  11. Nagasaka, K.: A study on gröbner basis with inexact input. In: Gerdt, V.P., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2009. LNCS, vol. 5743, pp. 248–258. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Sasaki, T.: A practical method for floating-point Gröbner basis computation. In: Proceedings of ASCM 2009, Asian Symposium on Computer Mathematics, Fukuoka, Japan, Math-for-industry series, vol. 22, pp. 167–176. Kyushu Univ. (2009)

    Google Scholar 

  13. Sasaki, T.: A subresultant-like theory for Buchberger’s procedure, 17 p. Preprint of Univ. Tsukuba (March 2010)

    Google Scholar 

  14. Sasaki, T., Kako, F.: Computing floating-point Gröbner base stably. In: Proceedings of SNC 2007, Symbolic Numeric Computation, London, Canada, pp. 180–189 (2007)

    Google Scholar 

  15. Sasaki, T., Kako, F.: Floating-point Gröbner basis computation with ill-conditionedness estimation. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol. 5081, pp. 278–292. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Shirayanagi, K.: An algorithm to compute floating-point Gröbner bases. In: Mathematical Computation with Maple V. Ideas and Applications, pp. 95–106. Birkhäuser, Basel (1993)

    Chapter  Google Scholar 

  17. Shirayanagi, K.: Floating point Gröbner bases. Mathematics and Computers in Simulation 42, 509–528 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shirayanagi, K., Sweedler, M.: Remarks on automatic algorithm stabilization. J. Symb. Comput. 26, 761–765 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  19. Stetter, H.J.: Stabilization of polynomial systems solving with Gröbner bases. In: Proceedings of ISSAC 1997, Intern’l Symposium on Symbolic and Algebraic Computation, pp. 117–124. ACM Press, New York (1997)

    Chapter  Google Scholar 

  20. Stetter, H.J.: Numerical Polynomial Algebra. SIAM Publ., Philadelphia (2004)

    Book  MATH  Google Scholar 

  21. Stetter, H.J.: Approximate Gröbner bases – an impossible concept? In: Proceedings of SNC 2005, Symbolic-Numeric Computation, Xi’an, China, pp. 235–236 (2005)

    Google Scholar 

  22. Suzuki, A.: Computing Gröbner bases within linear algebra. In: Gerdt, V.P., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2009. LNCS, vol. 5743, pp. 310–321. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Traverso, C.: Syzygies, and the stabilization of numerical Buchberger algorithm. In: Proceedings of LMCS 2002, Logic, Mathematics and Computer Science, RISC-Linz, Austria, pp. 244–255 (2002)

    Google Scholar 

  24. Traverso, C., Zanoni, A.: Numerical stability and stabilization of Gröbner basis computation. In: Proceedings of ISSAC 2002, Intern’l Symposium on Symbolic and Algebraic Computation, pp. 262–269. ACM Press, New York (2002)

    Chapter  Google Scholar 

  25. Weispfenning, V.: Gröbner bases for inexact input data. In: Proceedings of CASC 2003, Computer Algebra in Scientific Computing, Passau, Germany, pp. 403–411 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sasaki, T., Kako, F. (2010). Term Cancellations in Computing Floating-Point Gröbner Bases. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2010. Lecture Notes in Computer Science, vol 6244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15274-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15274-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15273-3

  • Online ISBN: 978-3-642-15274-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics