Skip to main content
SpringerLink
Log in

Walking faster

  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1128))

Abstract

The Gröbner Walk is an algorithm that converts a given Gröbner basis of a polynomial ideal I of arbitrary dimension to a Gröbner basis of I with respect to another term order. The conversion is done in several steps (the walk) following a path in the Gröbner fan of I. We report on our experiences with an implementation of the walk. We discuss several algorithmic variations as well as important implementation techniques whose combined effect is to elevate the walk to a new level of performance.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Amrhein, O. Gloor, and W. Küchlin. How Fast Does the Walk Run? 5th Rhine Workshop for Computer Algebra, St. Louis, France, 1996.

    Google Scholar 

  2. Buchberger, Collins, Encarnación, Hong, Johnson, Krandick, Loos, Mandache, Neubacher, and Vielhaber. SACLIB User's Guide, 1993. On-line documentation.

    Google Scholar 

  3. B. Buchberger. Gröbner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, chapter 6. Reidel, 1985. (Also Report CAMP-83.29, U. Linz, 1983).

    Google Scholar 

  4. B. Buchberger and W. Windsteiger. GRÖBNER: A library for computing Gröbner bases based on SACLIB, 1993. Manual for Version 2.0.

    Google Scholar 

  5. S. Collart, M. Kalkbrener, and D. Mall. Converting bases with the Gröbner Walk. JSC, 1996. In print.

    Google Scholar 

  6. J. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional Gröbner Bases by change of ordering. JSC, 16:329–344, 1993.

    Google Scholar 

  7. W. W. Küchlin. PARSAC-2: Parallel computer algebra on the desk-top. In J. Fleischer, J. Grabmeier, F. Hehl, and W. Küchlin, editors, Computer Algebra in Science and Engineering, pages 24–43, Singapore, 1995. World Scientific.

    Google Scholar 

  8. T. Mora and L. Robbiano. The Gröbner Fan of an ideal. JSC, 6:183–208, 1988.

    Google Scholar 

  9. PoSSo. Polynomial systems library. ftp: posso.dm.unipi.it.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm Schickard Institute for Computer Science, University of Tübingen, Germany

    Beatrice Amrhein, Oliver Gloor & Wolfgang Küchlin

Authors
  1. Beatrice Amrhein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Gloor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wolfgang Küchlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet Carla Limongelli

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amrhein, B., Gloor, O., Küchlin, W. (1996). Walking faster. In: Calmet, J., Limongelli, C. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1996. Lecture Notes in Computer Science, vol 1128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61697-7_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-61697-7_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61697-9

  • Online ISBN: 978-3-540-70635-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation