Using examples of interest from real problems, we will discuss the Dixon-EDF resultant as a method for symbolic solution of parametric polynomial systems. We will brieﬂy describe the method itself, then discuss problems arising in Nash equilibria, geometric computing, ﬂexibility of molecules, chemical reactions, global positioning systems, operations research, and others. We will compare Dixon-EDF to
several implementations of Groebner bases algorithms on several systems. We ﬁnd that Dixon-EDF is greatly superior.
Algebra/Algebraic Geometry > Conferences > Michigan Computational Algebraic Geometry, 2012. > Talks >