By Topic

An Improved Method for Computing Dixon Polynomial

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yaohui Li ; Dept. of Comput. Sci., Tianjian Univ. of Tech. & Educ., Tianjin ; Yong Feng ; Jiwei Xue

Computational methods for manipulating sets of polynomial equations are becoming of greater importance due to the use of polynomial in various applications. Dixon resultant algorithm provides one of the most efficient methods for solving the system of polynomial equations or eliminating variables. When computing Dixon resultant, we first construct the Dixon polynomial for input polynomial system. However, as the entries in the determinant are symbolic, large intermediate symbolic expression is generated and leads to computer algebra systems run for a long time or crash. To avoid the intermediate expression swell, we propose using Zippel's multivariate probabilistic interpolation to compute Dixon polynomial. At first, the method of truncated formal power series, which converts the operation of division to multiplication, is used to preprocess the expression of Dixon polynomial. Secondly, Dixon polynomial is interpolated heuristically by Zippel's method. In order to solve the linear equation effectively in Zippel's method, Kaltofen, E.'s efficient algorithm[4] is introduced to solve the equations of transposed Vandermonde system in interpolation. Besides these, we combine Zippel's multivariate method with Lagrange interpolation so as to take advantage of the sparsity of polynomial system sufficiently. Intermediate symbolic expressions can be reduced because the algorithm converts the symbolic computation to the numerical.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008