Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665): Difference between revisions

The problem the authors deal with is the following: Given a finite family \({\mathcal F}\) of multivariate polynomials over a field \(k\), they want to describe the affine variety \(V({\mathcal F})\) (that is, the common zeros of \({\mathcal F}\) in an algebraic closure of \(k\)). To do so, they want to obtain, from the family \({\mathcal F}\), simpler systems of polynomials, that is to say a finite family of polynomial sets related to \({\mathcal F}\) with particular properties. These sets are generically known as \textit{triangular sets} and their properties may differ depending on the definition of triangular set used. The authors are interested in the different known methods for solving polynomial systems by means of this kind of sets. They present four of these methods based on the works of \textit{W. Wu} [Kexue Tongbao 31, 1-5 (1986; Zbl 0602.14001)], \textit{D. Lazard} [Discrete Appl. Math. 33, 147-160 (1991; Zbl 0753.13013)], \textit{M. Kalkbrener} [Three contributions to elimination theory. Ph. D. Thesis, Johannes Kepler University, Linz (1992; Zbl 0773.13008)] and \textit{D. Wang} [J. Symb. Comput. 16, 83-114 (1993; Zbl 0803.13016)]. They implement them with the same material and software conditions. Afterwards, they apply these four implementations to several well-known examples and compare the timings, the degrees of the outputs and the dimensions obtained.