Comparing acceleration techniques for the Dixon and Macaulay resultants

DOI10.1016/j.matcom.2008.04.020zbMath1192.65056OpenAlexW2058821544MaRDI QIDQ974251

Robert H. Lewis

Publication date: 27 May 2010

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2008.04.020

zbMATH Keywords

polynomial systemsystem of equationsMacaulay resultantBézout-Dixon resultant methodDixon method

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04) Solving polynomial systems; resultants (13P15)

Related Items (3)

An analytical approach based on Dixon resultant for the inverse kinematics of 6R robot manipulators with offset wrists ⋮ Computing the Dixon Resultant with the Maple Package DR ⋮ Applications of an improved Dixon elimination method for the inverse kinematics of 6R manipulators

Uses Software

• Fermat
• MR

Cites Work

• Unnamed Item
• Some examples of the use of distances as coordinates for euclidean 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
• Heuristics to accelerate the Dixon resultant
• 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

This page was built for publication: Comparing acceleration techniques for the Dixon and Macaulay resultants