Abstract
It is well known that resultant elimination is an effective method of solving multivariate polynomial equations. In this paper, instead of computing the target resultants via variable by variable elimination, the authors combine multivariate implicit equation interpolation and multivariate resultant elimination to compute the reduced resultants, in which the technique of multivariate implicit equation interpolation is achieved by some high probability algorithms on multivariate polynomial interpolation and univariate rational function interpolation. As an application of resultant elimination, the authors illustrate the proposed algorithm on three well-known unsolved combinatorial geometric optimization problems. The experiments show that the proposed approach of resultant elimination is more efficient than some existing resultant elimination methods on these difficult problems.
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