Discrete Geometry for Algebraic Elimination
Multivariate resultants provide efficient methods for eliminating variables in algebraic systems. The theory of toric (or sparse) elimination generalizes the results of the classical theory to polynomials described by their supports, thus exploiting their sparseness. This is based on a discrete geometric model of the polynomials and requires a wide range of geometric notions as well as algorithms. This survey introduces toric resultants and their matrices, and shows how they reduce system solving and variable elimination to a problem in linear algebra. We also report on some practical experience.
KeywordsMatrix Polynomial Polynomial System Integer Point Mixed Volume Common Root
Unable to display preview. Download preview PDF.
- 3.J.F. Canny, E. Kaltofen, and Y. Lakshman. Solving systems of non-linear polynomial equations faster. In Proc. Annual ACM Intern. Symp. on Symbolic and Algebraic Computation, pages 121–128, 1989. ACM Press.Google Scholar
- 4.J. Canny and P. Pedersen. An algorithm for the Newton resultant. Technical Report 1394, Comp. Science Dept., Cornell University, 1993.Google Scholar
- 6.A. Diaz, I.Z. Emiris, E. Kaltofen, and V.Y. Pan. Algebraic algorithms. In M.J. Atallah, editor, Handbook of Algorithms and Theory of Computation, chapter 16. CRC Press, Boca Raton, Florida, 1999.Google Scholar
- 8.C. D’Andrea and I.Z. Emiris. Hybrid resultant matrices of bivariate polynomials. In Proc. Annual ACM Intern. Symp. on Symbolic and Algebraic Computation, pages 24–31, London, Ontario, 2001. ACM Press.Google Scholar
- 9.C. D’Andrea and I.Z. Emiris. Computing sparse projection operators. In Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering, vol. 286, AMS Contemporary Mathematics, pp. 121–139, Providence, Rhode Island, AMS, 2001.Google Scholar
- 10.A. Dickenstein and I.Z. Emiris. Multihomogeneous resultant matrices. In Proc. Annual ACM Intern. Symp. on Symbolic and Algebraic Computation, pp. 46–54, Lille, France, 2002. ACM Press, 2002.Google Scholar
- 12.I.Z. Emiris. A general solver based on sparse resultants: Numerical issues and kinematic applications. Technical Report 3110, Projet SAFIR, INRIA Sophia-Antipolis, France, 1997.Google Scholar
- 24.T.Y. Li. Numerical solution of multivariate polynomial systems by homotopy continuation methods. Acta Numerica, pages 399–436, 1997.Google Scholar
- 29.B. Sturmfels. Introduction to Resultants. In Applic. Computational Algebr. Geom., D.A. Cox and B. Sturmfels, eds., vol. 53, Proc. Symp. Applied Math., AMS, pages 25–39, 1998.Google Scholar