Symbolic recipes for polynomial system solving (Q4238959)

This chapter of the book edited by \textit{A. M. Cohen}, \textit{H. Cuypers} and \textit{H. Sterk}: ``Some tapas of computer algebra'' (1999; Zbl 0924.13021) has the purpose of showing how to use algorithms and the methodology provided by computer algebra in order to find the solutions of an algebraic system of equations with a finite number of complex solutions. The chapter is divided into four sections. In the first one some mathematical prerequisites are given, and some basic methods are shown to solve polynomial systems by using Gröbner bases. The second one shows how polynomial system solving can be reduced to a linear algebra problem. The third section deals with the special case of polynomial systems where the number of equations is equal to the number of indeterminates. In the last section the authors consider very briefly numerical approximation techniques where the coordinates of the solutions are represented as eigenvalues of some endomorphisms introduced in the third section. For the entire collection see [Zbl 0924.13021].