Abstract
AbstractGiven a system of polynomial equations with parameters, we present a new algorithm for computing its Dixon resultant R. Our algorithm interpolates the monic square-free factors of R one at a time from monic univariate polynomial images of R using sparse rational function interpolation. In this work, we use a modified version of the sparse multivariate rational function interpolation algorithm of Cuyt and Lee.We have implemented our new Dixon resultant algorithm in Maple with some subroutines coded in C for efficiency. We present timing results comparing our new Dixon resultant algorithm with Zippel’s algorithm for interpolating R and a Maple implementation of the Gentleman & Johnson minor expansion algorithm for computing R.KeywordsDixon resultantParametric polynomial systemsResultantSparse rational function interpolationKronecker substitution
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call