Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems

DOI10.1007/978-3-319-56932-1_16zbMath1393.68192OpenAlexW2736445602MaRDI QIDQ4610012

Robert H. Lewis

Publication date: 5 April 2018

Published in: Applications of Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56932-1_16

zbMATH Keywords

Gröbner basispolynomial systemdeterminantresultantsymbolic computingDixon

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)

Related Items (4)

An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases ⋮ Image analysis: identification of objects via polynomial systems ⋮ Dixon-EDF ⋮ An interpolation algorithm for computing Dixon resultants

Uses Software

• Fermat
• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The Bellows conjecture
• A resultant theory for the systems of two ordinary algebraic differential equations
• Conic tangency equations and Apollonius problems in biochemistry and pharmacology
• Flexibility of Bricard's linkages and other structures via resultants and computer algebra
• Heuristics to accelerate the Dixon resultant
• Resultants and loop closure
• The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution
• Algorithmic Search for Flexibility Using Resultants of Polynomial Systems

This page was built for publication: Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems