Algorithms for computing triangular decomposition of polynomial systems
From MaRDI portal
Publication:413407
DOI10.1016/J.JSC.2011.12.023zbMATH Open1264.12011OpenAlexW2053029682MaRDI QIDQ413407FDOQ413407
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
Cites Work
- Title not available (Why is that?)
- A complete algorithm for automated discovering of a class of inequality-type theorems
- Title not available (Why is that?)
- Associative differential operations
- Computing cylindrical algebraic decomposition via triangular decomposition
- Lifting techniques for triangular decompositions
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Bit-size estimates for triangular sets in positive dimension
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Decomposing polynomial systems into simple systems
- On the theories of triangular sets
- Comprehensive Triangular Decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new method for solving algebraic systems of positive dimension
- Factorization-free decomposition algorithms in differential algebra
- Title not available (Why is that?)
- Triangular decomposition of semi-algebraic systems
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Title not available (Why is that?)
- Title not available (Why is that?)
- An elimination method for polynomial systems
- Title not available (Why is that?)
- Characteristic set method for differential-difference polynomial systems
- Algorithmic properties of polynomial rings
- A zero structure theorem for differential parametric systems
- Optimizations of the subresultant algorithm
- Computations modulo regular chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for computing triangular decompositions of polynomial systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Localization and primary decomposition of polynomial ideals
Cited In (38)
- Computing triangular systems and regular systems
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Specifications for triangulation algorithms of elementary-algebraic systems
- Computing strong regular characteristic pairs with Gröbner bases
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Bounding the number of limit cycles for a polynomial Liénard system by using regular chains
- Computational schemes for subresultant chains
- Characteristic decomposition: from regular sets to normal sets
- Title not available (Why is that?)
- Algorithms for computing triangular decompositions of polynomial systems
- Deterministic normal position transformation and its applications
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- On solving parametric polynomial systems
- A Direttissimo Algorithm for Equidimensional Decomposition
- On the extended Hensel construction and its application to the computation of real limit points
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
- Comprehensive LU Factors of Polynomial Matrices
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Parameter identification on abelian integrals to achieve Chebyshev property
- Generic regular decompositions for parametric polynomial systems
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Formal derivation of algorithms
- On the Chordality of Simple Decomposition in Top-Down Style
- Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks
- Decomposition of polynomial sets into characteristic pairs
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Chordal graphs in triangular decomposition in top-down style
- On Isolating Roots in a Multiple Field Extension
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Title not available (Why is that?)
- Design and implementation of multi-threaded algorithms in polynomial algebra
- Comprehensive characteristic decomposition of parametric polynomial systems
- Two new ways to formally prove Dandelin-Gallucci's theorem
- Chordality Preserving Incremental Triangular Decomposition and Its Implementation
- Tensor inversion and its application to the tensor equations with Einstein product
- Parallelization of triangular decompositions: techniques and implementation
- Subresultant chains using Bézout matrices
Uses Software
Recommendations
- Algorithms for computing triangular decompositions of polynomial systems 👍 👎
- Title not available (Why is that?) 👍 👎
- Computations modulo regular chains 👍 👎
- Decomposing polynomial systems into simple systems 👍 👎
- The RegularChains library in Maple 10 👍 👎
- Triangular decomposition of semi-algebraic systems 👍 👎
- Solving via Modular Methods 👍 👎
- Intersection formulas and algorithms for computing triangular decompositions 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Algorithms for computing triangular decomposition of polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413407)
