Efficient techniques for multipolynomial resultant algorithms
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Multipolynomial resultants and linear algebra
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Distance approximations for rasterizing implicit curves
ACM Transactions on Graphics (TOG)
Algebraic and geometric reasoning using Dixon resultants
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
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.