Dixon-EDF: the premier method for solution of parametric polynomial systems
From MaRDI portal
Recommendations
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- A resultant theory for the systems of two ordinary algebraic differential equations
- Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
- 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
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- Resultants and loop closure
- The Bellows conjecture
- The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution
Cited in
(7)- Application of Dixon resultant to satellite trajectory control by pole placement
- An interpolation algorithm for computing Dixon resultants
- Computing the Dixon resultant with the Maple package DR
- 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
- Comparing acceleration techniques for the Dixon and Macaulay resultants
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)