Distributed computation of dixon resultant with changeable arguments

Abstract

Elimination method is an effective method for solving non-linear polynomial equations. It mainly includes Wu's methods, Grobner base and resultant methods. Dixon resultant is more efficient than other resultant methods. But Dixon matrix enlarges greatly when the polynomial sets have higher rank. Pro.Fu Hongguang et al worked out the recursive algorithm for computing Dixon resultant polynomial, by which the computation unit can be reduced. In this paper, distributed computing model for Dixon resultant is presented. GiNaC is transplanted and extended into distributed computing environment. The solution to communication etc problems is suggested. The system design and implementation are introduced, the computation result is given.