[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Implementation of the FGLM Algorithm and Finding Roots of Polynomial Involutive Systems

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper, an implementation of the FGLM algorithm that transforms Gröbner bases from one ordering to another is presented. Some additional optimizations that considerably expedite computations are considered. It is shown that this algorithm can be used for finding roots of polynomial systems represented in the involutive form.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

REFERENCES

  1. Buchberger, B., Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, Symbolic and Algebraic Computations, Buchberger, B., Collins, G., and Loos, R., Eds., Wien: Springer, 1982. Translated under the title Komp'yuternaya algebra. Simvol'nye i algebraicheskie vychisleniya, Moscow: Mir, 1986.

    Google Scholar 

  2. Gerdt, V.P. and Blinkov, Yu.A., Involutive Bases of Polynomial Ideals, Math. Comput. Simulation, 1998, vol. 45, pp. 519–542.

    Google Scholar 

  3. Gerdt, V.P. and Blinkov, Yu.A., Minimal Involutive Bases, Math. Comput. Simulation, 1998, vol. 45, pp. 543–560.

    Google Scholar 

  4. Gerdt, V.P., Blinkov, Yu.A., and Yanovich, D.A., Construction of Janet Bases. II. Polynomial Bases, Proc. of the Conf. “Computer Algebra in Scientific Computing” (CASC'01) (2001), Berlin: Springer, 2001.

    Google Scholar 

  5. Faugere, J.C., Gianni, P., Lazard, D., and Mora, T., Efficient Computation of Zero Dimensional Gröbner Bases by Change of Ordering, J. Symbolic Computation, 1993, vol. 16, pp. 329–344.

    Google Scholar 

  6. Bini, D. and Mourrain, B., Polynomial Test Suite, 1996, http://www-sop.inria.fr/saga/POL.

  7. Verschelde, J., The Database with Test Examples, http://www.math.uic.edu/~jan/demo.html.

Download references

Author information

Authors and Affiliations

  1. Joint Institute for Nuclear Research, Dubna, Moscow oblast, 141980, Russia yan@jinr.ru

    V. P. Gerdt & D. A. Yanovich

Authors
  1. V. P. Gerdt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. A. Yanovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gerdt, V.P., Yanovich, D.A. Implementation of the FGLM Algorithm and Finding Roots of Polynomial Involutive Systems. Programming and Computer Software 29, 72–74 (2003). https://doi.org/10.1023/A:1022992514981

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022992514981

Keywords

Search

Navigation