Computations of multi-resultant with mechanization

摘要

Resultant is a classical algebraic tool for determining whether or not a polynomial systems have a common root without explicitly solving for the roots. But, the complexity of resultants can be very high in practice. In this paper, by using the theories and methods of computer algebra, two reliable algorithms for computing multi-resultant problems—Dixon resultant and Macaulay resultant were established, two new Maple procedures dixonres and macaulayres were established, too. Some examples are presented to illustrate the implementations of the programs. This would be useful for solving a system of polynomial equations.