Multipolynomial Resultant Algorithms

Computational methods for manipulating sets of polynomial equations a re becoming of greater importance due to the use of polynomial equations in various applications. In some cases we need to eliminate variables from a given system of polynomial equations to obtain a "symbolically smaller" system, while in others we desire to compute the numerical solutions of non-linear polynomial equations. Recently, the techniques of Grobner bases and polynomial continuation have received much attention as algorithmic methods for these symbolic and numeric applications. When it comes to practice, these methods are slow and not effective for a variety of reasons. In this paper we present efficient techniques for applying multipolynomial resultant algorithms and show their effectiveness for manipulating system of polynomial equations. In particular, we present efficient algorithms for computing the resultant of a system of polynomial equations (who se coefficients may be symbolic variables). The algorithm can also be used for interpolating polynomials from their values and expanding symbolic determinants. Moreover, we use multipolynomial resultants for computing the real or complex solutions of non-linear polynomial equations. It reduces the problem to computing eigenvalues of matrices. We also discuss implementation of these algorithms in the context of certain applications.

[1]  Dinesh Manocha,et al.  A new approach for surface intersection , 1991, SMA '91.

[2]  Christoph M. Hoff.  Algebraic and Numerical Techniques for Off sets and Blends , 1989 .

[3]  Richard Zippel,et al.  Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..

[4]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[5]  John F. Canny,et al.  An Efficient Algorithm for the Sparse Mixed Resultant , 1993, AAECC.

[6]  Donald E. Knuth.  The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[7]  S. Abhyankar.  Historical Ramblings in Algebraic Geometry and Related Algebra , 1976 .

[8]  D. N. Bernshtein.  The number of roots of a system of equations , 1975 .

[9]  I. Emiris.  An E cient Algorithm for the Sparse Mixed Resultant John Canny ? and , 1993 .

[10]  Rüdiger Loos.  Computing Rational Zeros of Integral Polynomials by p-adic Expansion , 1983, SIAM J. Comput..

[11]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[12]  Christoph M. Hoffmann.  A dimensionality paradigm for surface interrogations , 1990, Comput. Aided Geom. Des..

[13]  Henry S. White.  Bézout’s theory of resultants and its influence on geometry , 1909 .

[14]  Bruno Buchberger,et al.  Applications of Gröbner Bases in Non-linear Computational Geometry , 1987, Trends in Computer Algebra.

[15]  Erich Kaltofen,et al.  Solving systems of nonlinear polynomial equations faster , 1989, ISSAC '89.

[16]  D. Manocha,et al.  Algebraic and numeric techniques in modeling and robotics , 1992 .

[17]  F. S. Macaulay,et al.  The Algebraic Theory of Modular Systems , 1972 .

[18]  Joe Warren,et al.  On the Applications of Multi-Equational Resultants , 1988 .

[19]  Frank Morley.  The Eliminant of a Net of Curves , 1925 .

[20]  A. L. Dixon.  The Eliminant of Three Quantics in two Independent Variables , 1909 .

[21]  Dinesh Manocha,et al.  Algorithms for intersecting parametric and algebraic curves , 1992 .

[22]  Erich Kaltofen,et al.  Improved Sparse Multivariate Polynomial Interpolation Algorithms , 1988, ISSAC.

[23]  F. Morley,et al.  New Results in Elimination , 1927 .

[24]  Y. N. Lakshman,et al.  Elimination methods: an introduction , 1992 .

[25]  F. S. Macaulay,et al.  Note on the Resultant of a Number of Polynomials of the Same Degree , 1923 .

[26]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[27]  A. Morgan,et al.  SOLVING THE 6R INVERSE POSITION PROBLEM USING A GENERIC-CASE SOLUTION METHODOLOGY , 1991 .

[28]  Xiao-Shan Gao,et al.  Implicitization of Rational Parametric Equations , 1992, J. Symb. Comput..

[29]  B. Sturmfels,et al.  Multigraded Resultants of Sylvester Type , 1994 .

[30]  George Salmon.  Lessons introductory to the modern higher algebra , 1885 .