Some examples of the use of distances as coordinates for Euclidean geometry
Journal of Symbolic Computation
Algebraic and geometric reasoning using Dixon resultants
ISSAC '94 Proceedings of the 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
Heuristics to accelerate the Dixon resultant
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
Multivariate resultants in Bernstein basis
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
| Hi-index | 0.00 |
The Bezout-Dixon resultant method for solving systems of polynomial equations lends itself to various heuristic acceleration techniques, previously reported by the present author, which can be extraordinarily effective. In this paper we will discuss how well these techniques apply to the Macaulay resultant. In brief, we find that they do work there with some difficulties, but the Dixon method is greatly superior. That they work at all is surprising and begs theoretical explanation.