Heuristics to accelerate the Dixon resultant
From MaRDI portal
Publication:2483552
DOI10.1016/j.matcom.2007.04.007zbMath1138.65037MaRDI QIDQ2483552
Publication date: 28 April 2008
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2007.04.007
65H10: Numerical computation of solutions to systems of equations
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65F40: Numerical computation of determinants
26C10: Real polynomials: location of zeros
Related Items
Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems, Computing the Dixon Resultant with the Maple Package DR, Cycles of the Logistic Map, Algorithmic Search for Flexibility Using Resultants of Polynomial Systems, Image analysis: identification of objects via polynomial systems, An analytical approach based on Dixon resultant for the inverse kinematics of 6R robot manipulators with offset wrists, Kukles revisited: Advances in computing techniques, Comparing acceleration techniques for the Dixon and Macaulay resultants, Heuristics to sift extraneous factors in Dixon resultants, Flexibility of Bricard's linkages and other structures via resultants and computer algebra
Uses Software
Cites Work
- Unnamed Item
- Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry
- Generalized resultants over unirational algebraic varieties
- Conic tangency equations and Apollonius problems in biochemistry and pharmacology
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- EXACT COMPUTATION OF THE BIFURCATION POINT B4 OF THE LOGISTIC MAP AND THE BAILEY–BROADHURST CONJECTURES
- Algorithmic Search for Flexibility Using Resultants of Polynomial Systems