Computing triangular systems and regular systems
From MaRDI portal
The author gives a technique to compute triangular systems and regular systems from a given system of polynomials. The resulting algorithms are based on computation of subresultant regular subchain, have a simple structure and are efficient in practice. The paper also provides several properties about regular systems.
Recommendations
- Algorithms for computing triangular decompositions of polynomial systems
- Algorithms for computing triangular decomposition of polynomial systems
- Intersection formulas and algorithms for computing triangular decompositions
- A new method for solving algebraic systems of positive dimension
- Triangular decomposition of semi-algebraic systems
Cites work
- A criterion for dependency of algebraic equations with applications to automated theorem proving
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new method for solving algebraic systems of positive dimension
- An elimination method for polynomial systems
- Decomposing polynomial systems into simple systems
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
- On the dimension of an arbitrary ascending chain
- On the theories of triangular sets
- Unmixed and prime decomposition of radicals of polynomial ideals
Cited in
(54)- Counting positive solutions for polynomial systems with real coefficients
- Real zeros of the zero-dimensional parametric piecewise algebraic variety
- Symbolic computation of the orthogonal projection of rational curves onto rational parameterized surfaces
- The maximum number and its distribution of singular points for parametric piecewise algebraic curves
- Characteristic decomposition: from regular sets to normal sets
- Elimination theory in differential and difference algebra
- An equivalence theorem for regular differential chains
- An algorithm for isolating the real solutions of semi-algebraic systems
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
- Heuristics to sift extraneous factors in Dixon resultants
- Chordal graphs in triangular decomposition in top-down style
- Computing strong regular characteristic pairs with Gröbner bases
- Generic regular decompositions for generic zero-dimensional systems
- Multiplicity-preserving triangular set decomposition of two polynomials
- Real solution isolation using interval arithmetic
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
- Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
- An incremental algorithm for computing cylindrical algebraic decompositions
- Recent advances in real geometric reasoning
- Stability analysis for discrete biological models using algebraic methods
- Computing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner bases
- An algebraic method to calculate parameter regions for constrained steady-state distribution in stochastic reaction networks
- Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification
- Triangular systems and a generalization of primitive polynomials
- Decomposition of polynomial sets into characteristic pairs
- On the Chordality of Simple Decomposition in Top-Down Style
- A test for monomial containment
- Computing switching surfaces in optimal control based on triangular decomposition
- Chordal networks of polynomial ideals
- A moment approach to analyze zeros of triangular polynomial sets
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Bifurcation analysis and complex dynamics of a Kopel triopoly model
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Two Variants of Bézout Subresultants for Several Univariate Polynomials
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- Solving parametric piecewise polynomial systems
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- Subresultants of several univariate polynomials in Newton basis
- On formal power series solutions of regular differential chains
- Comprehensive characteristic decomposition of parametric polynomial systems
- Subresultant of Bernstein polynomials and its application in computing the parametric greatest common divisor
- Choosing variable orderings based on elimination tree for sparse triangular decomposition
- Relations among multi-polynomial subresultants
- A Bertrand duopoly game with differentiated products reconsidered
- SMT solving over finite field arithmetic
- Complexity analysis of triangular decomposition over F₂ with strongly chordal graphs
- Properness defects of projection and minimal discriminant variety
- Computing the greatest common divisor of several parametric univariate polynomials via generalized subresultants
- Structural analysis of oligopoly equilibria based on triangular decomposition and cylindrical algebraic decomposition. Structural analysis of oligopoly equilibria
- Strongly and transitive chordal graphs and their applications in complexity analysis of triangular decomposition
- A new approach for constructing subresultants
- Generic regular decompositions for parametric polynomial systems
- Properties of regular systems and algorithmic improvements for regular decomposition
This page was built for publication: Computing triangular systems and regular systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582304)
