An elimination method for polynomial systems
From MaRDI portal
Publication:1332646
DOI10.1006/jsco.1993.1035zbMath0803.13016OpenAlexW2039228526WikidataQ56602966 ScholiaQ56602966MaRDI QIDQ1332646
Publication date: 18 December 1994
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1993.1035
Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (34)
Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems ⋮ A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity ⋮ Elimination procedures for mechanical theorem proving in geometry ⋮ A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers ⋮ A Direttissimo Algorithm for Equidimensional Decomposition ⋮ Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros ⋮ Sufficient and necessary center conditions for the Poincaré systems \(P(2, 2n) (n \leq 5)\) ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ Algorithms for computing triangular decomposition of polynomial systems ⋮ Characteristic set algorithms for equation solving in finite fields ⋮ 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 ⋮ A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications ⋮ A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification ⋮ A bound for the Rosenfeld-Gröbner algorithm ⋮ Characteristic decomposition: from regular sets to normal sets ⋮ Elimination theory in differential and difference algebra ⋮ Computer algebra methods in the study of nonlinear differential systems ⋮ Decomposition plans for geometric constraint systems. I: Performance measures for CAD ⋮ Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition ⋮ Computing the radical of an ideal in positive characteristic ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ Algebraic factoring and geometry theorem proving ⋮ On the theories of triangular sets ⋮ Triangular sets for solving polynomial systems: a comparative implementation of four methods ⋮ Polynomial systems from certain differential equations ⋮ Symbolic computation for the qualitative theory of differential equations ⋮ Computing triangular systems and regular systems ⋮ On the Chordality of Simple Decomposition in Top-Down Style ⋮ Specifications for triangulation algorithms of elementary-algebraic systems ⋮ Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
This page was built for publication: An elimination method for polynomial systems
