Comparison of various multivariate resultant formulations

Three most important resultant formulations are the Macaulay, Dixon and sparse resultant formulations. For most polynomial systems, however, the matrices constructed in these formulations become singular and the projection operator vanishes identically. In such cases, perturbation techniques for Macaulay formulation such as generalized characteristic polynomial ( GCP) and a method based on rank submatrix computation (RSG,), applicable to all three formulations, can be used, giving four methods, Macaulay/ GCP, Macaulay/RSC, Dixon/RSC and Sparse/RSC, for computing nontrivial projection operators. In this paper, these four methods are compared. It is shown that the Dixon matrix is (by a factor up to O(e’) for a certain class) smaller than the sparse resultant matrix which is (by a factor up to O (en) for a certain class) smaller than the Macaulay matrix. Empirical results confirm that Dixon/RSC’ is the most efficient, followed by Sparse/RSC then Macaulay/RSC and finally Macaulay/ GCP, which is found to be almost impractical. All four methods are found to generate extraneous factors in the projection operator. Efficient heuristics for interpolation, used to expand the resultant matrices. are also discussed.

[1]  Deepak Kapur,et al.  Algebraic and geometric reasoning using Dixon resultants , 1994, ISSAC '94.

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

[3]  J. Canny,et al.  Efficient incremental algorithms for the sparse resultant and the mixed volume , 1995 .

[4]  J. Canny,et al.  Efficient Incremental Algorithms for the , 1994 .

[5]  B. Buchberger,et al.  Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[6]  John F. Canny,et al.  Generalized Characteristic Polynomials , 1988, ISSAC.

[7]  John F. Canny,et al.  A practical method for the sparse resultant , 1993, ISSAC '93.

[8]  I. M. Gelʹfand,et al.  Discriminants, Resultants, and Multidimensional Determinants , 1994 .

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

[10]  B. Donald,et al.  Symbolic and Numerical Computation for Artificial Intelligence , 1997 .

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

[12]  E. Chionh Base points, resultants, and the implicit representation of rational surfaces , 1990 .

[13]  Ron Goldman,et al.  Algebraic Geometry for Computer-Aided Geometric Design , 1986, IEEE Computer Graphics and Applications.

[14]  M. Stark,et al.  THE THEORY OF ELIMINATION , 1964 .

[15]  John F. Canny,et al.  Generalised Characteristic Polynomials , 1990, J. Symb. Comput..

[16]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[17]  J. Canny,et al.  An Algorithm for the Newton Resultant , 1993 .

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

[19]  Deepak Kapur,et al.  Sparsity considerations in the dixon resultant formulation , 1996, STOC 1996.

[20]  N. Bose Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory , 1995 .

[21]  George E. Collins,et al.  The Calculation of Multivariate Polynomial Resultants , 1971, JACM.

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