Decomposing polynomial systems into simple systems

DOI10.1006/jsco.1997.0177zbMath0913.12008OpenAlexW2056521839WikidataQ56602967 ScholiaQ56602967MaRDI QIDQ1264446

Dongming Wang

Publication date: 7 June 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1997.0177

zbMATH Keywords

algorithmpolynomial systemsimple systempolynomial orderings

Mathematics Subject Classification ID

Related Items (33)

Challenging theorem provers with Mathematical Olympiad problems in solid geometry ⋮ Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems ⋮ Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros ⋮ Algorithms for computing triangular decomposition of polynomial systems ⋮ Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case ⋮ Squarefree normal representation of zeros of zero-dimensional polynomial systems ⋮ Chordal graphs in triangular decomposition in top-down style ⋮ Computing real radicals and \(S\)-radicals of polynomial systems ⋮ Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Thomas Decomposition and Nonlinear Control Systems ⋮ A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. ⋮ Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification ⋮ The monotonicity of ratios of some abelian integrals ⋮ An algebraic method to calculate parameter regions for constrained steady-state distribution in stochastic reaction networks ⋮ Characteristic decomposition: from regular sets to normal sets ⋮ Elimination theory in differential and difference algebra ⋮ A test for monomial containment ⋮ A systematic framework for solving geometric constraints analytically ⋮ Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition ⋮ Properties of regular systems and algorithmic improvements for regular decomposition ⋮ An alternative algorithm for computing the pseudo-remainder of multivariate polynomials ⋮ Thomas Decomposition of Algebraic and Differential Systems ⋮ On the links between triangular sets and dynamic constructible closure ⋮ Parameter identification on abelian integrals to achieve Chebyshev property ⋮ An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ On the theories of triangular sets ⋮ Triangular sets for solving polynomial systems: a comparative implementation of four methods ⋮ Real zeros of the zero-dimensional parametric piecewise algebraic variety ⋮ Computing triangular systems and regular systems ⋮ On the Chordality of Simple Decomposition in Top-Down Style ⋮ Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition ⋮ An algorithm for isolating the real solutions of semi-algebraic systems

This page was built for publication: Decomposing polynomial systems into simple systems