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

DOI10.1007/978-3-319-56932-1_16zbMATH Open1393.68192OpenAlexW2736445602MaRDI QIDQ4610012FDOQ4610012

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

determinantpolynomial systemsymbolic computingresultantDixonGröbner basis

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)

Cites Work

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

Cited In (4)

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

Uses Software

• Fermat
• Maple

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

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