“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 17694 | ||||||||||||||||||||||
|
||||||||||||||||||||||
| Abstract: | ||||||||||||||||||||||
|
In this paper, we present a parametric F4 algorithm (so-
called PF4) which can be considered as a generalization of Faugere's
F4 algorithm [8] to polynomial ideals with parametric coefficients. Our
approach is based on the F4 algorithm, Montes DisPGB algorithm [21]
and the parametric linear algebra method developed in [6]. The PF4
algorithm takes as input a parametric polynomial ideal and two monomial
orderings on the variables and the parameters and returns a Grobner
system of the ideal with respect to a compatible elimination product of
the given monomial orderings. We have implemented our new algorithm
in Maple and give timings to compare its performance with those of
(our implementation) of the Kapur et al. algorithm [16] and the DisPGB
algorithm [21].
Download TeX format |
||||||||||||||||||||||
| back to top | ||||||||||||||||||||||
