Algorithms for computing triangular decomposition of polynomial systems

DOI10.1016/j.jsc.2011.12.023zbMath1264.12011OpenAlexW2053029682MaRDI QIDQ413407

Changbo Chen, Marc Moreno Maza

Publication date: 7 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.023

zbMATH Keywords

resultanttriangular decompositioncharacteristic setregular chainregular GCD

Mathematics Subject Classification ID

Related Items (26)

Chordality Preserving Incremental Triangular Decomposition and Its Implementation ⋮ Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks ⋮ Computational schemes for subresultant chains ⋮ Solving multi-linear systems with \(\mathcal {M}\)-tensors ⋮ An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ A Direttissimo Algorithm for Equidimensional Decomposition ⋮ On Isolating Roots in a Multiple Field Extension ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ Squarefree normal representation of zeros of zero-dimensional polynomial systems ⋮ Chordal graphs in triangular decomposition in top-down style ⋮ Generic regular decompositions for parametric polynomial systems ⋮ On solving parametric polynomial systems ⋮ Characteristic decomposition: from regular sets to normal sets ⋮ Tensor inversion and its application to the tensor equations with Einstein product ⋮ Computing strong regular characteristic pairs with Gröbner bases ⋮ Bounding the number of limit cycles for a polynomial Liénard system by using regular chains ⋮ Deterministic normal position transformation and its applications ⋮ Parameter identification on abelian integrals to achieve Chebyshev property ⋮ On the extended Hensel construction and its application to the computation of real limit points ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ Whitney's theorem, triangular sets, and probabilistic descent on manifolds ⋮ Comprehensive LU Factors of Polynomial Matrices ⋮ On the Chordality of Simple Decomposition in Top-Down Style ⋮ Subresultant chains using Bézout matrices ⋮ Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition

Uses Software

• Maple
• RegularChains
• DISCOVERER
• Wsolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Bit-size estimates for triangular sets in positive dimension
• Localization and primary decomposition of polynomial ideals
• A complete algorithm for automated discovering of a class of inequality-type theorems
• Characteristic set method for differential-difference polynomial systems
• A new method for solving algebraic systems of positive dimension
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• Decomposing polynomial systems into simple systems
• Algorithmic properties of polynomial rings
• A zero structure theorem for differential parametric systems
• An elimination method for polynomial systems
• Factorization-free decomposition algorithms in differential algebra
• On the theories of triangular sets
• Optimizations of the subresultant algorithm
• Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
• Associative differential operations
• Computing cylindrical algebraic decomposition via triangular decomposition
• Computations modulo regular chains
• Comprehensive Triangular Decomposition
• Algorithms for computing triangular decompositions of polynomial systems
• Lifting techniques for triangular decompositions
• Triangular decomposition of semi-algebraic systems

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