Solving systems of algebraic equations by using gröbner bases
In this paper we give an explicit description of an algorithm for finding all solutions of a system of algebraic equations which is solvable and has finitely many solutions. This algorithm is an improved version of a method which was deviced by B. Buchberger. By a theorem proven in this paper, gcd-computations occurring in Buchberger's method can be avoided in our algorithm.
Unable to display preview. Download preview PDF.
- B. Buchberger: Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, in Recent Trends in Multidimensional Systems Theory, N.K. Bose (ed.), D. Reidel Publ. Comp. 184–232 (1985)Google Scholar
- D. Lazard: Ideal Bases and Primary Decomposition: Case of Two Variables, J. of Symbolic Computation 1, 261–270 (1985)Google Scholar
- B.L. van der Waerden: Algebra II, Springer-Verlag (1967)Google Scholar