A new method for solving algebraic systems of positive dimension
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 4118469 (Why is no real title available?)
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- Complexity of a standard basis of a D-module.
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Solving zero-dimensional algebraic systems
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
Cited in
(62)- Rational general solutions of higher order algebraic ODEs
- Computing triangular systems and regular systems
- Simple characteristic decomposition of polynomial sets
- Computing strong regular characteristic pairs with Gröbner bases
- A systematic framework for solving geometric constraints analytically
- Change of order for regular chains in positive dimension
- Computing differential characteristic sets by change of ordering
- Characteristic decomposition: from regular sets to normal sets
- Mode decomposition of global bifurcation diagram with Gröbner bases
- A syzygial method for equidimensional decomposition
- Complexity results for triangular sets
- Algorithms for computing triangular decomposition of polynomial systems
- Characteristic set algorithms for equation solving in finite fields
- An Algorithm for Transforming Regular Chain into Normal Chain
- Bit-size estimates for triangular sets in positive dimension
- Multiplicity-preserving triangular set decomposition of two polynomials
- Chordality preserving incremental triangular decomposition and its implementation
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- A characteristic set method for ordinary difference polynomial systems
- An algorithm for decomposing a polynomial system into normal ascending sets
- Properness defects of projection and minimal discriminant variety
- On solving parametric polynomial systems
- scientific article; zbMATH DE number 804603 (Why is no real title available?)
- On the theory of resolvents and its applications.
- A Direttissimo Algorithm for Equidimensional Decomposition
- On approximate linearized triangular decompositions
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- On approximate triangular decompositions in dimension zero
- Decomposition of polynomial ideals into triangular regular sequences
- Complexity analysis of triangular decomposition over F₂ with strongly chordal graphs
- A moment approach to analyze zeros of triangular polynomial sets
- On computer-assisted classification of coupled integrable equations
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- On the complexity of counting components of algebraic varieties
- Triangular systems and a generalization of primitive polynomials
- Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
- A generalized Euclidean algorithm for geometry theorem proving
- Algorithms for multivariate laurent series
- Rational general solutions of trivariate rational differential systems
- Choosing variable orderings based on elimination tree for sparse triangular decomposition
- Relaxed Hensel lifting of triangular sets
- Computing real radicals and S-radicals of polynomial systems
- On the theories of triangular sets
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- On non-binomial structure of cyclic 8-roots
- Decomposition of polynomial sets into characteristic pairs
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
- Stability analysis for discrete biological models using algebraic methods
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- The application of normal ascending set in solving system of parametric algebraic equations
- On formal power series solutions of regular differential chains
- Examples of using dynamic constructible closure.
- On the links between triangular sets and dynamic constructible closure
- Satisfiability modulo finite fields
- An equivalence theorem for regular differential chains
- Fast arithmetic for triangular sets: from theory to practice
- A note on upper bounds for ideal-theoretic problems
- A Moment Approach to Analyze Zeros of Triangular Polynomial Sets
This page was built for publication: A new method for solving algebraic systems of positive dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180160)
