Triangular sets for solving polynomial systems: a comparative implementation of four methods
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.
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new method for solving algebraic systems of positive dimension
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- Algorithmic properties of polynomial rings
- An elimination method for polynomial systems
- Applied algebra, algebraic algorithms and error-correcting codes. 11th international symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings
- Converting bases with the Gröbner walk
- Decomposing polynomial systems into simple systems
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Hilbert functions and the Buchberger algorithm
- scientific article; zbMATH DE number 421655 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 41286 (Why is no real title available?)
- scientific article; zbMATH DE number 107769 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 778203 (Why is no real title available?)
- scientific article; zbMATH DE number 3196340 (Why is no real title available?)
- On decomposing systems of polynomial equations with finitely many solutions
- On the theories of triangular sets
- Properties of Gröbner bases under specializations
- Solving systems of algebraic equations by using Gröbner bases
- Solving zero-dimensional algebraic systems
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Specifications for triangulation algorithms of elementary-algebraic systems
- On the theories of triangular sets
- Computing real solutions of fuzzy polynomial systems
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Chordal graphs in triangular decomposition in top-down style
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- On approximate triangular decompositions in dimension zero
- Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
- Solving via modular methods
- Computing isolated roots of sparse polynomial systems in affine space
- Decomposition of polynomial sets into characteristic pairs
- A test for monomial containment
- A moment approach to analyze zeros of triangular polynomial sets
- On computer-assisted classification of coupled integrable equations
- Using Galois ideals for computing relative resolvents
- On the links between triangular sets and dynamic constructible closure
- Bifurcation analysis and complex dynamics of a Kopel triopoly model
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- A Bertrand duopoly game with differentiated products reconsidered
- SMT solving over finite field arithmetic
- Decomposition of polynomial ideals into triangular regular sequences
- Properness defects of projection and minimal discriminant variety
- Structural analysis of oligopoly equilibria based on triangular decomposition and cylindrical algebraic decomposition. Structural analysis of oligopoly equilibria
- Sum-and-quotient characteristic decomposition of polynomial ideals
This page was built for publication: Triangular sets for solving polynomial systems: a comparative implementation of four methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808665)
