Heuristics to accelerate the Dixon resultant

DOI10.1016/j.matcom.2007.04.007zbMath1138.65037OpenAlexW1966979296MaRDI QIDQ2483552

Robert H. Lewis

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

zbMATH Keywords

numerical examplesdeterminantresultantsystem of polynomial equationsDixon resultant method

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of determinants (65F40) Real polynomials: location of zeros (26C10)

Related Items

An analytical approach based on Dixon resultant for the inverse kinematics of 6R robot manipulators with offset wrists ⋮ Kukles revisited: Advances in computing techniques ⋮ Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems ⋮ Computing the Dixon Resultant with the Maple Package DR ⋮ Flexibility of Bricard's linkages and other structures via resultants and computer algebra ⋮ Cycles of the Logistic Map ⋮ Comparing acceleration techniques for the Dixon and Macaulay resultants ⋮ Image analysis: identification of objects via polynomial systems ⋮ Algorithmic Search for Flexibility Using Resultants of Polynomial Systems ⋮ Heuristics to sift extraneous factors in Dixon resultants

Uses Software

• Fermat

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 B₄ OF THE LOGISTIC MAP AND THE BAILEY–BROADHURST CONJECTURES
• Algorithmic Search for Flexibility Using Resultants of Polynomial Systems