Triangular sets for solving polynomial systems: a comparative implementation of four methods
From MaRDI portal
Publication:1808665
zbMath0943.12004MaRDI QIDQ1808665
Marc Moreno Maza, Philippe Aubry
Publication date: 5 September 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items
Solving via Modular Methods, Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems, Solving multi-linear systems with \(\mathcal {M}\)-tensors, Bifurcation analysis and complex dynamics of a Kopel triopoly model, Chordal graphs in triangular decomposition in top-down style, When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?, On computer-assisted classification of coupled integrable equations, A moment approach to analyze zeros of triangular polynomial sets, On approximate triangular decompositions in dimension zero, A test for monomial containment, Using Galois ideals for computing relative resolvents, On the links between triangular sets and dynamic constructible closure, Properness defects of projection and minimal discriminant variety, Computing real solutions of fuzzy polynomial systems, Decomposition of polynomial sets into characteristic pairs, On the theories of triangular sets, Whitney's theorem, triangular sets, and probabilistic descent on manifolds, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Specifications for triangulation algorithms of elementary-algebraic systems, Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hilbert functions and the Buchberger algorithm
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- A new method for solving algebraic systems of positive dimension
- Solving zero-dimensional algebraic systems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Decomposing polynomial systems into simple systems
- Algorithmic properties of polynomial rings
- On decomposing systems of polynomial equations with finitely many solutions
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- An elimination method for polynomial systems
- Converting bases with the Gröbner walk
- On the theories of triangular sets
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Applied algebra, algebraic algorithms and error-correcting codes. 11th international symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- Solving systems of algebraic equations by using gröbner bases
- Properties of Gröbner bases under specializations
