On selection of nonmultiplicative prolongations in computation of Janet bases
- 1 May 2007
- journal article
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 33 (3) , 147-153
Abstract
We consider three modifications of our basic involutive algorithm for computing polynomial Janet bases. These modifications, which are related to degree-compatible monomial orders, yield specific selection strategies for nonmultiplicative prolongations. Using a standard database of benchmarks designed for testing programs computing Gröbner bases, we compare these algorithmic modifications (in terms of their efficiency) with Faugére’s F 4 algorithm, which is built in the Magma computer algebra system.Keywords
This publication has 8 references indexed in Scilit:
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- Computing Toric IdealsJournal of Symbolic Computation, 1999
- Involutive bases of polynomial idealsMathematics and Computers in Simulation, 1998
- Converting Bases with the Gröbner WalkJournal of Symbolic Computation, 1997
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993
- “One sugar cube, please” or selection strategies in the Buchberger algorithm1991
- Buchberger algorithm and integer programming1991
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory1985