Comparison of various multivariate resultant formulations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Efficient incremental algorithms for the sparse resultant and the mixed volume
Journal of Symbolic Computation
Generalized resultants over unirational algebraic varieties
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
SIAM Journal on Numerical Analysis
Conic tangency equations and Apollonius problems in biochemistry and pharmacology
Mathematics and Computers in Simulation
Algorithmic search for flexibility using resultants of polynomial systems
ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
Comparing acceleration techniques for the dixon and macaulay resultants (abstract only)
ACM Communications in Computer Algebra
A method for finding zeros of polynomial equations using a contour integral based eigensolver
Proceedings of the 2009 conference on Symbolic numeric computation
Comparing acceleration techniques for the Dixon and Macaulay resultants
Mathematics and Computers in Simulation
Algorithmic search for flexibility using resultants of polynomial systems
ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
Kukles revisited: Advances in computing techniques
Computers & Mathematics with Applications
Hi-index | 0.00 |
The Dixon resultant method solves a system of polynomial equations by computing its resultant. It constructs a square matrix whose determinant (det) is a multiple of the resultant (res). The naive way to proceed is to compute det, factor it, and identify res. But often det is too large to compute or factor, even though res is relatively small. In this paper we describe three heuristic methods that often overcome these problems. The first, although sometimes useful by itself, is often a subprocedure of the second two. The second may be used on any polynomial system to discover factors of det without producing the complete determinant. The third applies when res appears as a factor of det in a certain exponential pattern. This occurs in some symmetrical systems of equations. We show examples from computational chemistry, signal processing, dynamical systems, quantifier elimination, and pure mathematics.