Gröbner bases and primary decomposition of polynomial ideals
Journal of Symbolic Computation
Ritt-Wu's decomposition algorithm and geometry theorem proving
CADE-10 Proceedings of the tenth international conference on Automated deduction
A new method for solving algebraic systems of positive dimension
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
Journal of Symbolic Computation
An elimination method for polynomial systems
Journal of Symbolic Computation
Irreducible decomposition of algebraic varieties via characteristic sets and Gro¨bner bases
Computer Aided Geometric Design
Searching dependency between algebraic equations: an algorithm applied to automated reasoning
Artificial intelligence in mathematics
Prime decompositions of radicals in polynomial rings
Journal of Symbolic Computation
Localization and primary decomposition of polynomial ideals
Journal of Symbolic Computation
Solving polynomial equations: characteristic sets and triangular systems
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Decomposing polynomial systems into simple systems
Journal of Symbolic Computation
Unmixed and prime decomposition of radicals of polynomial ideals
ACM SIGSAM Bulletin
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
| Hi-index | 0.00 |
An algebraic variety is a geometric figure defined by the zeros of a set of multivariate polynomials. This paper explains how to adapt two general zero decomposition methods for efficient decomposition of affine algebraic varieties into unmixed and irreducible components. Two devices based on Gröbner bases are presented for computing the generators of the saturated ideals of triangular sets. We also discuss a few techniques and variants which, when properly used, may speed up the decomposition. Experiments for a set of examples are reported with comparison to show the performance and effectiveness of such techniques, variants and the whole decomposition methods. Several theoretical results are stated along with the description of algorithms. The paper ends with a brief mention of some applications of variety decomposition.