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.
Similar content being viewed by others
REFERENCES
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.
Gerdt, V.P. and Blinkov, Yu.A., Involutive Bases of Polynomial Ideals, Math. Comput. Simulation, 1998, vol. 45, pp. 519–542.
Gerdt, V.P. and Blinkov, Yu.A., Minimal Involutive Bases, Math. Comput. Simulation, 1998, vol. 45, pp. 543–560.
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.
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.
Bini, D. and Mourrain, B., Polynomial Test Suite, 1996, http://www-sop.inria.fr/saga/POL.
Verschelde, J., The Database with Test Examples, http://www.math.uic.edu/~jan/demo.html.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1023/A:1022992514981