Algorithms for computing triangular decompositions of polynomial systems
From MaRDI portal
Abstract: We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {em weakened} notion of a polynomial GCD modulo a regular chain, which permits to greatly simplify and optimize the sub-algorithms. Extracting common work from similar expensive computations is also a key feature of our algorithms. In our experimental results the implementation of our new algorithms, realized with the {RegularChains} library in {Maple}, outperforms solvers with similar specifications by several orders of magnitude on sufficiently difficult problems.
Recommendations
- Algorithms for computing triangular decomposition of polynomial systems
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- scientific article; zbMATH DE number 1979251
- Algorithms related to the decomposition of polynomials
- Triangular decomposition of semi-algebraic systems
- Triangular decomposition of semi-algebraic systems
Cited in
(28)- Fast arithmetic for triangular sets: from theory to practice
- Computing triangular systems and regular systems
- Specifications for triangulation algorithms of elementary-algebraic systems
- Elimination theory in differential and difference algebra
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Chordal graphs in triangular decomposition in top-down style
- Effective algorithms for computing triangular operator in Schubert calculus
- Multiplicity-preserving triangular set decomposition of two polynomials
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Parallelization of triangular decompositions: techniques and implementation
- Computations modulo regular chains
- Algorithms for computing triangular decomposition of polynomial systems
- scientific article; zbMATH DE number 1736022 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 1979252 (Why is no real title available?)
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Chordality preserving incremental triangular decomposition and its implementation
- Bivariate triangular decompositions in the presence of asymptotes
- Intersection formulas and algorithms for computing triangular decompositions
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Formal derivation of algorithms
- Triangular decomposition of semi-algebraic systems
- Triangular decomposition of semi-algebraic systems
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Subresultant of Bernstein polynomials and its application in computing the parametric greatest common divisor
- Structural analysis of oligopoly equilibria based on triangular decomposition and cylindrical algebraic decomposition. Structural analysis of oligopoly equilibria
This page was built for publication: Algorithms for computing triangular decompositions of polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254157)
