Heuristics to accelerate the Dixon resultant

DOI10.1016/J.MATCOM.2007.04.007MaRDI QIDQ2483552zbMATH OpenOpenAlexFDO

Authors 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 examplesdeterminantsystem of polynomial equationsresultantDixon 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) Real polynomials: location of zeros (26C10) Numerical computation of determinants (65F40)

Recommendations

• scientific article; zbMATH DE number 2151215
• scientific article; zbMATH DE number 1189069
• scientific article; zbMATH DE number 1263399
• Comparing acceleration techniques for the Dixon and Macaulay resultants
• An extended fast algorithm for constructing the Dixon resultant matrix

Cites work

• scientific article; zbMATH DE number 1254250 (Why is no real title available?)
• Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
• Conic tangency equations and Apollonius problems in biochemistry and pharmacology
• EXACT COMPUTATION OF THE BIFURCATION POINT B₄ OF THE LOGISTIC MAP AND THE BAILEY–BROADHURST CONJECTURES
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Generalized resultants over unirational algebraic varieties
• Numerical decomposition of the solution sets of polynomial systems into irreducible components
• Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry

Cited in

(20)

• Dixon-EDF: the premier method for solution of parametric polynomial systems
• An interpolation algorithm for computing Dixon resultants
• On factorizing the symbolic \(U\)-resultant. Application of the \(ddet\) operator
• Comparing acceleration techniques for the Dixon and Macaulay resultants
• Flexibility of Bricard's linkages and other structures via resultants and computer algebra
• Kukles revisited: Advances in computing techniques
• Cycles of the logistic map
• An analytical approach based on Dixon resultant for the inverse kinematics of 6R robot manipulators with offset wrists
• Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
• Applying Dixon resultants in cryptography
• Image analysis: identification of objects via polynomial systems
• Three kinds of extraneous factors in Dixon resultants
• Computations of multi-resultant with mechanization
• scientific article; zbMATH DE number 1189069 (Why is no real title available?)
• Resultants and loop closure
• scientific article; zbMATH DE number 2151215 (Why is no real title available?)
• Heuristics to sift extraneous factors in Dixon resultants
• An extended fast algorithm for constructing the Dixon resultant matrix
• A new interpolation algorithm for computing dixon resultants
• Computing the Dixon resultant with the Maple package DR

Describes a project that uses

Uses Software

• Fermat

This page was built for publication: Heuristics to accelerate the Dixon resultant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483552)