Triangular sets for solving polynomial systems: a comparative implementation of four methods
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 421655 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 41286 (Why is no real title available?)
- scientific article; zbMATH DE number 107769 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 778203 (Why is no real title available?)
- scientific article; zbMATH DE number 3196340 (Why is no real title available?)
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new method for solving algebraic systems of positive dimension
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- Algorithmic properties of polynomial rings
- An elimination method for polynomial systems
- Applied algebra, algebraic algorithms and error-correcting codes. 11th international symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings
- Converting bases with the Gröbner walk
- Decomposing polynomial systems into simple systems
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Hilbert functions and the Buchberger algorithm
- On decomposing systems of polynomial equations with finitely many solutions
- On the theories of triangular sets
- Properties of Gröbner bases under specializations
- Solving systems of algebraic equations by using Gröbner bases
- Solving zero-dimensional algebraic systems
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- The complexity of the word problems for commutative semigroups and polynomial ideals
Cited in
(21)- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Specifications for triangulation algorithms of elementary-algebraic systems
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Computing isolated roots of sparse polynomial systems in affine space
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Properness defects of projection and minimal discriminant variety
- Bifurcation analysis and complex dynamics of a Kopel triopoly model
- On approximate triangular decompositions in dimension zero
- Computing real solutions of fuzzy polynomial systems
- Using Galois ideals for computing relative resolvents
- Solving via modular methods
- A moment approach to analyze zeros of triangular polynomial sets
- On computer-assisted classification of coupled integrable equations
- Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
- On the theories of triangular sets
- Decomposition of polynomial sets into characteristic pairs
- Chordal graphs in triangular decomposition in top-down style
- A test for monomial containment
- On the links between triangular sets and dynamic constructible closure
This page was built for publication: Triangular sets for solving polynomial systems: a comparative implementation of four methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808665)
