Algorithms for computing triangular decompositions of polynomial systems

DOI10.1145/1993886.1993904zbMath1323.68589arXiv1104.0689OpenAlexW2128486174MaRDI QIDQ5254157

Changbo Chen, Marc Moreno Maza

Publication date: 9 June 2015

Published in: Proceedings of the 36th international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.0689

zbMATH Keywords

polynomial systemsubresultanttriangular decompositionincremental algorithmregular chainregular GCD

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (6)

Chordality Preserving Incremental Triangular Decomposition and Its Implementation ⋮ 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 ⋮ Elimination theory in differential and difference algebra ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one

Uses Software

• Maple
• RegularChains
• Wsolve

This page was built for publication: Algorithms for computing triangular decompositions of polynomial systems