An Algorithm for Solving Systems of Algebraic Equations in Three Variables
The most famous algorithm for computing the greatest common divisor (gcd) of two univariate polynomials over a field is, undoubtedly, the algorithm of Euclid. In attempting to generalize it to the multivariate case one easily arrives at the concept of polynomial remainder sequences and discovers the phenomenon of explosive coefficient growth (see, e.g., Brown 1971). To overcome this problem primitive polynomial remainder sequences (pprs) have been introduced. However, the classical primitive polynomial remainder sequence algorithm for computing gcds (Brown 1971) has one rather obvious disadvantage. In order to make a polynomial primitive, its content, which is the gcd of its coefficients, has to be computed. Therefore, additional gcd computations in the coefficient domain are necessary for computing a pprs. Fortunately, the costs of these content computations can be considerably reduced by subresultant techniques (Collins 1967, Brown and Traub 1971, Brown 1978) or trial division (Hearn 1979, Stoutemyer 1985).
KeywordsAlgebraic Equation Induction Hypothesis Great Common Divisor Input Specification Common Zero
Unable to display preview. Download preview PDF.
- Canny, J. (1988): The complexity of robot motion planning. MIT Press, Cambridge, MA.Google Scholar
- Gatermann, K. (1990): Symbolic solution of polynomial equation systems with symmetry. In: Proc. ISSAC’ 90, Tokyo, Japan, 1990, pp. 112–119.Google Scholar
- Gebauer, R., Kalkbrener, M., Wall, B., Winkler, F. (1991): CASA: a computer algebra package for constructive algebraic geometry. In: Proc. ISSAC’ 91, Bonn, Germany, 1991, pp. 403–410.Google Scholar
- Hearn, A. C. (1979): Non-modular computation of polynomial gcds using trial division. In: Proc. EUROSAM’ 79, Marseille, France, 1979, pp. 227–239.Google Scholar
- Kalkbrener, M. (1991): Three contributions to elimination theory. Ph.D. thesis, Research Institute for Symbolic Computation, University of Linz, Linz, Austria.Google Scholar
- Kalkbrener, M. (1992): Primitive polynomial remainder sequences in elimination theory. Tech. Rep. MSI-Ser. 92-12, Cornell University, Ithaca, USA.Google Scholar
- Stoutemyer, D. R. (1985): Polynomial remainder sequence greatest common divisors revisited. In: Proc. Second RIKEN Int. Symp. on Symbolic and Algebraic Computation by Computers. World Scientific Publishing, Singapore, pp. 1–12.Google Scholar
- Wu, W.-t. (1984): Basic principles of mechanical theorem proving in elementary geometries. J. Syst. Sci. Math. Sci. 4: 207–235.Google Scholar